./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-11.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_amount250_file-11.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 938d0421a545f95d5fd4476ad4101c37e59d7c0d9287a6793e2d4f45bec79d41 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:13:19,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:13:19,218 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:13:19,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:13:19,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:13:19,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:13:19,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:13:19,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:13:19,253 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:13:19,253 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:13:19,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:13:19,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:13:19,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:13:19,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:13:19,254 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:13:19,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:13:19,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:13:19,254 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:13:19,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:13:19,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:13:19,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:13:19,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:13:19,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:13:19,254 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:13:19,254 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:13:19,254 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:13:19,254 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:13:19,254 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:13:19,255 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:13:19,255 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:13:19,255 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:13:19,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:13:19,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:13:19,255 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:13:19,255 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:13:19,255 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:13:19,255 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:13:19,255 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:13:19,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:13:19,255 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:13:19,255 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:13:19,255 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:13:19,255 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:13:19,255 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 -> 938d0421a545f95d5fd4476ad4101c37e59d7c0d9287a6793e2d4f45bec79d41 [2025-02-06 02:13:19,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:13:19,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:13:19,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:13:19,467 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:13:19,467 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:13:19,467 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-11.i [2025-02-06 02:13:20,551 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0486dda83/3e1a501670bf41099361629cea4b9b65/FLAG109da1421 [2025-02-06 02:13:20,789 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:13:20,790 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-11.i [2025-02-06 02:13:20,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0486dda83/3e1a501670bf41099361629cea4b9b65/FLAG109da1421 [2025-02-06 02:13:21,107 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0486dda83/3e1a501670bf41099361629cea4b9b65 [2025-02-06 02:13:21,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:13:21,110 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:13:21,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:13:21,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:13:21,115 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:13:21,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:13:21" (1/1) ... [2025-02-06 02:13:21,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f26124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:21, skipping insertion in model container [2025-02-06 02:13:21,117 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:13:21" (1/1) ... [2025-02-06 02:13:21,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:13:21,230 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_amount250_file-11.i[916,929] [2025-02-06 02:13:21,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:13:21,355 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:13:21,364 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_amount250_file-11.i[916,929] [2025-02-06 02:13:21,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:13:21,444 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:13:21,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:21 WrapperNode [2025-02-06 02:13:21,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:13:21,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:13:21,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:13:21,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:13:21,451 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:13:21" (1/1) ... [2025-02-06 02:13:21,462 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:13:21" (1/1) ... [2025-02-06 02:13:21,499 INFO L138 Inliner]: procedures = 26, calls = 58, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 431 [2025-02-06 02:13:21,500 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:13:21,500 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:13:21,500 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:13:21,500 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:13:21,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:21" (1/1) ... [2025-02-06 02:13:21,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:21" (1/1) ... [2025-02-06 02:13:21,511 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:21" (1/1) ... [2025-02-06 02:13:21,537 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:13:21,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:21" (1/1) ... [2025-02-06 02:13:21,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:21" (1/1) ... [2025-02-06 02:13:21,551 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:21" (1/1) ... [2025-02-06 02:13:21,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:21" (1/1) ... [2025-02-06 02:13:21,554 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:21" (1/1) ... [2025-02-06 02:13:21,558 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:21" (1/1) ... [2025-02-06 02:13:21,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:13:21,564 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:13:21,564 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:13:21,564 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:13:21,564 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:21" (1/1) ... [2025-02-06 02:13:21,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:13:21,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:13:21,591 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:13:21,594 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:13:21,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:13:21,608 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:13:21,609 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:13:21,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:13:21,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:13:21,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:13:21,678 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:13:21,679 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:13:22,227 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L372: havoc property_#t~bitwise36#1;havoc property_#t~bitwise37#1;havoc property_#t~bitwise38#1;havoc property_#t~short39#1;havoc property_#t~bitwise40#1;havoc property_#t~short41#1; [2025-02-06 02:13:22,289 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2025-02-06 02:13:22,290 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:13:22,308 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:13:22,309 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:13:22,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:13:22 BoogieIcfgContainer [2025-02-06 02:13:22,309 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:13:22,312 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:13:22,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:13:22,315 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:13:22,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:13:21" (1/3) ... [2025-02-06 02:13:22,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3052c478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:13:22, skipping insertion in model container [2025-02-06 02:13:22,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:13:21" (2/3) ... [2025-02-06 02:13:22,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3052c478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:13:22, skipping insertion in model container [2025-02-06 02:13:22,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:13:22" (3/3) ... [2025-02-06 02:13:22,318 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-11.i [2025-02-06 02:13:22,327 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:13:22,330 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-11.i that has 2 procedures, 174 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:13:22,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:13:22,388 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;@6e912f95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:13:22,389 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:13:22,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 174 states, 126 states have (on average 1.4761904761904763) internal successors, (186), 127 states have internal predecessors, (186), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-06 02:13:22,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-02-06 02:13:22,407 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:13:22,407 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:22,408 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:13:22,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:13:22,411 INFO L85 PathProgramCache]: Analyzing trace with hash 327161117, now seen corresponding path program 1 times [2025-02-06 02:13:22,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:13:22,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097979216] [2025-02-06 02:13:22,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:13:22,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:13:22,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-02-06 02:13:22,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-02-06 02:13:22,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:13:22,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:13:22,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-02-06 02:13:22,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:13:22,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097979216] [2025-02-06 02:13:22,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097979216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:13:22,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:13:22,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 02:13:22,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043199407] [2025-02-06 02:13:22,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:13:22,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:13:22,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:13:22,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:13:22,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:13:22,898 INFO L87 Difference]: Start difference. First operand has 174 states, 126 states have (on average 1.4761904761904763) internal successors, (186), 127 states have internal predecessors, (186), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand has 2 states, 2 states have (on average 45.5) internal successors, (91), 2 states have internal predecessors, (91), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-02-06 02:13:22,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:13:22,947 INFO L93 Difference]: Finished difference Result 340 states and 590 transitions. [2025-02-06 02:13:22,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:13:22,950 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 45.5) internal successors, (91), 2 states have internal predecessors, (91), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 313 [2025-02-06 02:13:22,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:13:22,961 INFO L225 Difference]: With dead ends: 340 [2025-02-06 02:13:22,961 INFO L226 Difference]: Without dead ends: 169 [2025-02-06 02:13:22,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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:13:22,967 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:13:22,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:13:22,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-02-06 02:13:22,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-02-06 02:13:22,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 122 states have (on average 1.4344262295081966) internal successors, (175), 122 states have internal predecessors, (175), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-06 02:13:23,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 265 transitions. [2025-02-06 02:13:23,002 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 265 transitions. Word has length 313 [2025-02-06 02:13:23,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:13:23,004 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 265 transitions. [2025-02-06 02:13:23,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.5) internal successors, (91), 2 states have internal predecessors, (91), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-02-06 02:13:23,004 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 265 transitions. [2025-02-06 02:13:23,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-02-06 02:13:23,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:13:23,008 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:23,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 02:13:23,008 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:13:23,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:13:23,009 INFO L85 PathProgramCache]: Analyzing trace with hash 72424572, now seen corresponding path program 1 times [2025-02-06 02:13:23,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:13:23,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309698059] [2025-02-06 02:13:23,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:13:23,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:13:23,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-02-06 02:13:23,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-02-06 02:13:23,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:13:23,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:13:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-02-06 02:13:23,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:13:23,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309698059] [2025-02-06 02:13:23,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309698059] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:13:23,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:13:23,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:13:23,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148017713] [2025-02-06 02:13:23,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:13:23,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:13:23,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:13:23,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:13:23,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:13:23,430 INFO L87 Difference]: Start difference. First operand 169 states and 265 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-02-06 02:13:23,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:13:23,659 INFO L93 Difference]: Finished difference Result 502 states and 790 transitions. [2025-02-06 02:13:23,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:13:23,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 313 [2025-02-06 02:13:23,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:13:23,662 INFO L225 Difference]: With dead ends: 502 [2025-02-06 02:13:23,662 INFO L226 Difference]: Without dead ends: 336 [2025-02-06 02:13:23,663 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:13:23,664 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 207 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:13:23,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 759 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:13:23,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-02-06 02:13:23,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 327. [2025-02-06 02:13:23,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 234 states have (on average 1.4401709401709402) internal successors, (337), 234 states have internal predecessors, (337), 90 states have call successors, (90), 2 states have call predecessors, (90), 2 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-06 02:13:23,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 517 transitions. [2025-02-06 02:13:23,717 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 517 transitions. Word has length 313 [2025-02-06 02:13:23,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:13:23,720 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 517 transitions. [2025-02-06 02:13:23,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-02-06 02:13:23,721 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 517 transitions. [2025-02-06 02:13:23,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-02-06 02:13:23,727 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:13:23,727 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:23,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:13:23,728 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:13:23,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:13:23,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1792787622, now seen corresponding path program 1 times [2025-02-06 02:13:23,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:13:23,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718120830] [2025-02-06 02:13:23,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:13:23,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:13:23,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-02-06 02:13:23,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-02-06 02:13:23,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:13:23,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:13:23,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-02-06 02:13:23,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:13:23,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718120830] [2025-02-06 02:13:23,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718120830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:13:23,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:13:23,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:13:23,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264401326] [2025-02-06 02:13:23,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:13:23,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:13:23,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:13:23,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:13:23,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:13:23,954 INFO L87 Difference]: Start difference. First operand 327 states and 517 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-02-06 02:13:24,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:13:24,078 INFO L93 Difference]: Finished difference Result 754 states and 1192 transitions. [2025-02-06 02:13:24,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:13:24,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 314 [2025-02-06 02:13:24,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:13:24,084 INFO L225 Difference]: With dead ends: 754 [2025-02-06 02:13:24,084 INFO L226 Difference]: Without dead ends: 540 [2025-02-06 02:13:24,085 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:13:24,085 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 220 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:13:24,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 614 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:13:24,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-02-06 02:13:24,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 389. [2025-02-06 02:13:24,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 296 states have (on average 1.4493243243243243) internal successors, (429), 296 states have internal predecessors, (429), 90 states have call successors, (90), 2 states have call predecessors, (90), 2 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-06 02:13:24,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 609 transitions. [2025-02-06 02:13:24,123 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 609 transitions. Word has length 314 [2025-02-06 02:13:24,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:13:24,125 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 609 transitions. [2025-02-06 02:13:24,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-02-06 02:13:24,125 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 609 transitions. [2025-02-06 02:13:24,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-02-06 02:13:24,128 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:13:24,128 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:24,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:13:24,128 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:13:24,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:13:24,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1838657299, now seen corresponding path program 1 times [2025-02-06 02:13:24,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:13:24,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935289007] [2025-02-06 02:13:24,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:13:24,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:13:24,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-02-06 02:13:24,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-02-06 02:13:24,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:13:24,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:13:25,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-02-06 02:13:25,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:13:25,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935289007] [2025-02-06 02:13:25,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935289007] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:13:25,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:13:25,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 02:13:25,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084369324] [2025-02-06 02:13:25,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:13:25,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:13:25,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:13:25,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:13:25,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:13:25,636 INFO L87 Difference]: Start difference. First operand 389 states and 609 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-02-06 02:13:26,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:13:26,651 INFO L93 Difference]: Finished difference Result 941 states and 1457 transitions. [2025-02-06 02:13:26,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 02:13:26,651 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 315 [2025-02-06 02:13:26,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:13:26,655 INFO L225 Difference]: With dead ends: 941 [2025-02-06 02:13:26,655 INFO L226 Difference]: Without dead ends: 693 [2025-02-06 02:13:26,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-02-06 02:13:26,656 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 848 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:13:26,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 1635 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 02:13:26,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-02-06 02:13:26,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 444. [2025-02-06 02:13:26,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 350 states have (on average 1.4542857142857142) internal successors, (509), 350 states have internal predecessors, (509), 90 states have call successors, (90), 3 states have call predecessors, (90), 3 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-06 02:13:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 689 transitions. [2025-02-06 02:13:26,691 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 689 transitions. Word has length 315 [2025-02-06 02:13:26,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:13:26,692 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 689 transitions. [2025-02-06 02:13:26,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-02-06 02:13:26,692 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 689 transitions. [2025-02-06 02:13:26,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-02-06 02:13:26,695 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:13:26,695 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:26,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:13:26,695 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:13:26,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:13:26,696 INFO L85 PathProgramCache]: Analyzing trace with hash -705466706, now seen corresponding path program 1 times [2025-02-06 02:13:26,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:13:26,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644012765] [2025-02-06 02:13:26,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:13:26,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:13:26,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-02-06 02:13:27,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-02-06 02:13:27,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:13:27,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:13:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-02-06 02:13:30,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:13:30,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644012765] [2025-02-06 02:13:30,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644012765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:13:30,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:13:30,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 02:13:30,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27494532] [2025-02-06 02:13:30,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:13:30,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 02:13:30,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:13:30,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 02:13:30,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:13:30,977 INFO L87 Difference]: Start difference. First operand 444 states and 689 transitions. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 3 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2025-02-06 02:13:33,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:13:33,876 INFO L93 Difference]: Finished difference Result 968 states and 1495 transitions. [2025-02-06 02:13:33,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 02:13:33,876 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 3 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) Word has length 315 [2025-02-06 02:13:33,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:13:33,882 INFO L225 Difference]: With dead ends: 968 [2025-02-06 02:13:33,882 INFO L226 Difference]: Without dead ends: 671 [2025-02-06 02:13:33,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2025-02-06 02:13:33,884 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 1345 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1345 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:13:33,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1345 Valid, 1448 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-06 02:13:33,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-02-06 02:13:33,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 588. [2025-02-06 02:13:33,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 494 states have (on average 1.4817813765182186) internal successors, (732), 494 states have internal predecessors, (732), 90 states have call successors, (90), 3 states have call predecessors, (90), 3 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-06 02:13:33,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 912 transitions. [2025-02-06 02:13:33,927 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 912 transitions. Word has length 315 [2025-02-06 02:13:33,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:13:33,928 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 912 transitions. [2025-02-06 02:13:33,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 3 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2025-02-06 02:13:33,928 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 912 transitions. [2025-02-06 02:13:33,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-02-06 02:13:33,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:13:33,931 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:33,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:13:33,931 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:13:33,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:13:33,931 INFO L85 PathProgramCache]: Analyzing trace with hash -694150579, now seen corresponding path program 1 times [2025-02-06 02:13:33,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:13:33,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146064962] [2025-02-06 02:13:33,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:13:33,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:13:33,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-02-06 02:13:34,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-02-06 02:13:34,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:13:34,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:13:35,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-02-06 02:13:35,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:13:35,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146064962] [2025-02-06 02:13:35,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146064962] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:13:35,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:13:35,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 02:13:35,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797796385] [2025-02-06 02:13:35,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:13:35,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 02:13:35,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:13:35,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 02:13:35,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:13:35,427 INFO L87 Difference]: Start difference. First operand 588 states and 912 transitions. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-02-06 02:13:36,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:13:36,107 INFO L93 Difference]: Finished difference Result 898 states and 1382 transitions. [2025-02-06 02:13:36,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 02:13:36,108 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 315 [2025-02-06 02:13:36,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:13:36,112 INFO L225 Difference]: With dead ends: 898 [2025-02-06 02:13:36,112 INFO L226 Difference]: Without dead ends: 621 [2025-02-06 02:13:36,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2025-02-06 02:13:36,115 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 743 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:13:36,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1330 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:13:36,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-02-06 02:13:36,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 592. [2025-02-06 02:13:36,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 498 states have (on average 1.4779116465863453) internal successors, (736), 498 states have internal predecessors, (736), 90 states have call successors, (90), 3 states have call predecessors, (90), 3 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-06 02:13:36,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 916 transitions. [2025-02-06 02:13:36,149 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 916 transitions. Word has length 315 [2025-02-06 02:13:36,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:13:36,150 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 916 transitions. [2025-02-06 02:13:36,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-02-06 02:13:36,152 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 916 transitions. [2025-02-06 02:13:36,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-02-06 02:13:36,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:13:36,156 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:36,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:13:36,156 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:13:36,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:13:36,156 INFO L85 PathProgramCache]: Analyzing trace with hash 938653420, now seen corresponding path program 1 times [2025-02-06 02:13:36,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:13:36,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150282144] [2025-02-06 02:13:36,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:13:36,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:13:36,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-02-06 02:13:36,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-02-06 02:13:36,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:13:36,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:13:36,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 6 proven. 126 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-02-06 02:13:36,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:13:36,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150282144] [2025-02-06 02:13:36,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150282144] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:13:36,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710660188] [2025-02-06 02:13:36,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:13:36,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:13:36,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:13:36,602 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:13:36,604 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:13:36,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-02-06 02:13:36,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-02-06 02:13:36,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:13:36,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:13:36,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 02:13:36,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:13:37,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 384 proven. 126 refuted. 0 times theorem prover too weak. 3450 trivial. 0 not checked. [2025-02-06 02:13:37,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:13:37,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 6 proven. 126 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-02-06 02:13:37,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710660188] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:13:37,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:13:37,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-06 02:13:37,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339907839] [2025-02-06 02:13:37,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:13:37,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:13:37,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:13:37,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:13:37,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:13:37,402 INFO L87 Difference]: Start difference. First operand 592 states and 916 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 2 states have call successors, (87), 2 states have call predecessors, (87), 4 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) [2025-02-06 02:13:37,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:13:37,635 INFO L93 Difference]: Finished difference Result 985 states and 1520 transitions. [2025-02-06 02:13:37,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 02:13:37,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 2 states have call successors, (87), 2 states have call predecessors, (87), 4 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) Word has length 315 [2025-02-06 02:13:37,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:13:37,638 INFO L225 Difference]: With dead ends: 985 [2025-02-06 02:13:37,638 INFO L226 Difference]: Without dead ends: 606 [2025-02-06 02:13:37,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 628 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:13:37,640 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 124 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:13:37,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 508 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:13:37,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-02-06 02:13:37,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 596. [2025-02-06 02:13:37,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 500 states have (on average 1.448) internal successors, (724), 500 states have internal predecessors, (724), 90 states have call successors, (90), 5 states have call predecessors, (90), 5 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-06 02:13:37,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 904 transitions. [2025-02-06 02:13:37,670 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 904 transitions. Word has length 315 [2025-02-06 02:13:37,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:13:37,671 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 904 transitions. [2025-02-06 02:13:37,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 2 states have call successors, (87), 2 states have call predecessors, (87), 4 states have return successors, (88), 2 states have call predecessors, (88), 2 states have call successors, (88) [2025-02-06 02:13:37,671 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 904 transitions. [2025-02-06 02:13:37,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-02-06 02:13:37,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:13:37,673 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:37,682 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:13:37,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:13:37,878 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:13:37,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:13:37,878 INFO L85 PathProgramCache]: Analyzing trace with hash 526635115, now seen corresponding path program 1 times [2025-02-06 02:13:37,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:13:37,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087817571] [2025-02-06 02:13:37,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:13:37,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:13:37,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-02-06 02:13:38,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-02-06 02:13:38,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:13:38,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:13:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-02-06 02:13:39,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:13:39,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087817571] [2025-02-06 02:13:39,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087817571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:13:39,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:13:39,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 02:13:39,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618344341] [2025-02-06 02:13:39,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:13:39,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 02:13:39,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:13:39,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 02:13:39,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:13:39,570 INFO L87 Difference]: Start difference. First operand 596 states and 904 transitions. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-02-06 02:13:40,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:13:40,463 INFO L93 Difference]: Finished difference Result 906 states and 1364 transitions. [2025-02-06 02:13:40,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:13:40,464 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 317 [2025-02-06 02:13:40,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:13:40,467 INFO L225 Difference]: With dead ends: 906 [2025-02-06 02:13:40,467 INFO L226 Difference]: Without dead ends: 625 [2025-02-06 02:13:40,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-06 02:13:40,468 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 457 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:13:40,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1667 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 02:13:40,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-02-06 02:13:40,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 596. [2025-02-06 02:13:40,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 500 states have (on average 1.44) internal successors, (720), 500 states have internal predecessors, (720), 90 states have call successors, (90), 5 states have call predecessors, (90), 5 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-06 02:13:40,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 900 transitions. [2025-02-06 02:13:40,497 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 900 transitions. Word has length 317 [2025-02-06 02:13:40,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:13:40,497 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 900 transitions. [2025-02-06 02:13:40,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-02-06 02:13:40,497 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 900 transitions. [2025-02-06 02:13:40,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-02-06 02:13:40,499 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:13:40,499 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:40,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:13:40,499 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:13:40,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:13:40,500 INFO L85 PathProgramCache]: Analyzing trace with hash -396048468, now seen corresponding path program 1 times [2025-02-06 02:13:40,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:13:40,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665353283] [2025-02-06 02:13:40,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:13:40,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:13:40,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-02-06 02:13:40,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-02-06 02:13:40,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:13:40,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:13:40,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 111 proven. 21 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-02-06 02:13:40,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:13:40,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665353283] [2025-02-06 02:13:40,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665353283] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:13:40,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077385169] [2025-02-06 02:13:40,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:13:40,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:13:40,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:13:40,958 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:13:40,960 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:13:41,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-02-06 02:13:41,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-02-06 02:13:41,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:13:41,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:13:41,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 02:13:41,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:13:41,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1952 proven. 78 refuted. 0 times theorem prover too weak. 1930 trivial. 0 not checked. [2025-02-06 02:13:41,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:13:42,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 54 proven. 78 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-02-06 02:13:42,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077385169] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:13:42,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:13:42,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2025-02-06 02:13:42,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492732733] [2025-02-06 02:13:42,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:13:42,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 02:13:42,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:13:42,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 02:13:42,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-02-06 02:13:42,032 INFO L87 Difference]: Start difference. First operand 596 states and 900 transitions. Second operand has 16 states, 16 states have (on average 12.875) internal successors, (206), 16 states have internal predecessors, (206), 4 states have call successors, (97), 2 states have call predecessors, (97), 4 states have return successors, (99), 4 states have call predecessors, (99), 4 states have call successors, (99) [2025-02-06 02:13:43,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:13:43,659 INFO L93 Difference]: Finished difference Result 2102 states and 3201 transitions. [2025-02-06 02:13:43,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-02-06 02:13:43,660 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 12.875) internal successors, (206), 16 states have internal predecessors, (206), 4 states have call successors, (97), 2 states have call predecessors, (97), 4 states have return successors, (99), 4 states have call predecessors, (99), 4 states have call successors, (99) Word has length 317 [2025-02-06 02:13:43,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:13:43,665 INFO L225 Difference]: With dead ends: 2102 [2025-02-06 02:13:43,666 INFO L226 Difference]: Without dead ends: 1631 [2025-02-06 02:13:43,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 675 GetRequests, 631 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=498, Invalid=1572, Unknown=0, NotChecked=0, Total=2070 [2025-02-06 02:13:43,668 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 1686 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 1634 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1706 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 1946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 1634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:13:43,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1706 Valid, 1568 Invalid, 1946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 1634 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 02:13:43,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2025-02-06 02:13:43,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1346. [2025-02-06 02:13:43,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1203 states have (on average 1.4380714879467997) internal successors, (1730), 1204 states have internal predecessors, (1730), 127 states have call successors, (127), 15 states have call predecessors, (127), 15 states have return successors, (127), 126 states have call predecessors, (127), 127 states have call successors, (127) [2025-02-06 02:13:43,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1984 transitions. [2025-02-06 02:13:43,717 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1984 transitions. Word has length 317 [2025-02-06 02:13:43,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:13:43,718 INFO L471 AbstractCegarLoop]: Abstraction has 1346 states and 1984 transitions. [2025-02-06 02:13:43,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.875) internal successors, (206), 16 states have internal predecessors, (206), 4 states have call successors, (97), 2 states have call predecessors, (97), 4 states have return successors, (99), 4 states have call predecessors, (99), 4 states have call successors, (99) [2025-02-06 02:13:43,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1984 transitions. [2025-02-06 02:13:43,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-02-06 02:13:43,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:13:43,721 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:43,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 02:13:43,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:13:43,922 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:13:43,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:13:43,922 INFO L85 PathProgramCache]: Analyzing trace with hash -530888611, now seen corresponding path program 1 times [2025-02-06 02:13:43,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:13:43,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645088039] [2025-02-06 02:13:43,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:13:43,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:13:43,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-02-06 02:13:44,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-02-06 02:13:44,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:13:44,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:13:44,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-02-06 02:13:44,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:13:44,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645088039] [2025-02-06 02:13:44,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645088039] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:13:44,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:13:44,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:13:44,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492363997] [2025-02-06 02:13:44,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:13:44,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:13:44,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:13:44,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:13:44,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:13:44,339 INFO L87 Difference]: Start difference. First operand 1346 states and 1984 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-02-06 02:13:44,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:13:44,653 INFO L93 Difference]: Finished difference Result 1968 states and 2910 transitions. [2025-02-06 02:13:44,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:13:44,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 318 [2025-02-06 02:13:44,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:13:44,658 INFO L225 Difference]: With dead ends: 1968 [2025-02-06 02:13:44,658 INFO L226 Difference]: Without dead ends: 1345 [2025-02-06 02:13:44,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:13:44,659 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 305 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:13:44,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 951 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:13:44,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2025-02-06 02:13:44,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1292. [2025-02-06 02:13:44,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 1149 states have (on average 1.4360313315926894) internal successors, (1650), 1150 states have internal predecessors, (1650), 127 states have call successors, (127), 15 states have call predecessors, (127), 15 states have return successors, (127), 126 states have call predecessors, (127), 127 states have call successors, (127) [2025-02-06 02:13:44,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1904 transitions. [2025-02-06 02:13:44,698 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1904 transitions. Word has length 318 [2025-02-06 02:13:44,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:13:44,698 INFO L471 AbstractCegarLoop]: Abstraction has 1292 states and 1904 transitions. [2025-02-06 02:13:44,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-02-06 02:13:44,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1904 transitions. [2025-02-06 02:13:44,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-02-06 02:13:44,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:13:44,701 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:44,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:13:44,701 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:13:44,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:13:44,701 INFO L85 PathProgramCache]: Analyzing trace with hash -179318659, now seen corresponding path program 1 times [2025-02-06 02:13:44,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:13:44,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452437524] [2025-02-06 02:13:44,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:13:44,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:13:44,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-02-06 02:13:44,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-02-06 02:13:44,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:13:44,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:13:45,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 54 proven. 78 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-02-06 02:13:45,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:13:45,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452437524] [2025-02-06 02:13:45,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452437524] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:13:45,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362345627] [2025-02-06 02:13:45,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:13:45,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:13:45,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:13:45,224 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:13:45,225 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:13:45,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-02-06 02:13:45,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-02-06 02:13:45,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:13:45,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:13:45,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-06 02:13:45,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:13:46,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 2088 proven. 231 refuted. 0 times theorem prover too weak. 1641 trivial. 0 not checked. [2025-02-06 02:13:46,942 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:13:47,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362345627] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:13:47,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 02:13:47,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17] total 24 [2025-02-06 02:13:47,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922851013] [2025-02-06 02:13:47,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 02:13:47,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 02:13:47,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:13:47,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 02:13:47,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=891, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 02:13:47,643 INFO L87 Difference]: Start difference. First operand 1292 states and 1904 transitions. Second operand has 24 states, 24 states have (on average 8.25) internal successors, (198), 23 states have internal predecessors, (198), 6 states have call successors, (90), 5 states have call predecessors, (90), 8 states have return successors, (90), 6 states have call predecessors, (90), 6 states have call successors, (90) [2025-02-06 02:13:51,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:13:51,160 INFO L93 Difference]: Finished difference Result 3492 states and 5017 transitions. [2025-02-06 02:13:51,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-02-06 02:13:51,160 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.25) internal successors, (198), 23 states have internal predecessors, (198), 6 states have call successors, (90), 5 states have call predecessors, (90), 8 states have return successors, (90), 6 states have call predecessors, (90), 6 states have call successors, (90) Word has length 318 [2025-02-06 02:13:51,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:13:51,169 INFO L225 Difference]: With dead ends: 3492 [2025-02-06 02:13:51,169 INFO L226 Difference]: Without dead ends: 2467 [2025-02-06 02:13:51,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2389 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1424, Invalid=6586, Unknown=0, NotChecked=0, Total=8010 [2025-02-06 02:13:51,172 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 1653 mSDsluCounter, 2912 mSDsCounter, 0 mSdLazyCounter, 4006 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 3264 SdHoareTripleChecker+Invalid, 4426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 4006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:13:51,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1689 Valid, 3264 Invalid, 4426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 4006 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-06 02:13:51,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2025-02-06 02:13:51,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 1939. [2025-02-06 02:13:51,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1939 states, 1720 states have (on average 1.4145348837209302) internal successors, (2433), 1725 states have internal predecessors, (2433), 191 states have call successors, (191), 27 states have call predecessors, (191), 27 states have return successors, (191), 186 states have call predecessors, (191), 191 states have call successors, (191) [2025-02-06 02:13:51,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2815 transitions. [2025-02-06 02:13:51,243 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 2815 transitions. Word has length 318 [2025-02-06 02:13:51,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:13:51,243 INFO L471 AbstractCegarLoop]: Abstraction has 1939 states and 2815 transitions. [2025-02-06 02:13:51,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.25) internal successors, (198), 23 states have internal predecessors, (198), 6 states have call successors, (90), 5 states have call predecessors, (90), 8 states have return successors, (90), 6 states have call predecessors, (90), 6 states have call successors, (90) [2025-02-06 02:13:51,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2815 transitions. [2025-02-06 02:13:51,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-02-06 02:13:51,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:13:51,246 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:51,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 02:13:51,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:13:51,447 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:13:51,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:13:51,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1943161053, now seen corresponding path program 1 times [2025-02-06 02:13:51,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:13:51,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579979481] [2025-02-06 02:13:51,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:13:51,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:13:51,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-02-06 02:13:51,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-02-06 02:13:51,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:13:51,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:13:51,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-02-06 02:13:51,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:13:51,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579979481] [2025-02-06 02:13:51,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579979481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:13:51,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:13:51,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:13:51,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998527876] [2025-02-06 02:13:51,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:13:51,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:13:51,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:13:51,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:13:51,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:13:51,645 INFO L87 Difference]: Start difference. First operand 1939 states and 2815 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-02-06 02:13:51,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:13:51,711 INFO L93 Difference]: Finished difference Result 2712 states and 3912 transitions. [2025-02-06 02:13:51,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:13:51,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 318 [2025-02-06 02:13:51,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:13:51,717 INFO L225 Difference]: With dead ends: 2712 [2025-02-06 02:13:51,717 INFO L226 Difference]: Without dead ends: 1827 [2025-02-06 02:13:51,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:13:51,719 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 0 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:13:51,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 500 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:13:51,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2025-02-06 02:13:51,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1827. [2025-02-06 02:13:51,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1827 states, 1608 states have (on average 1.3837064676616915) internal successors, (2225), 1613 states have internal predecessors, (2225), 191 states have call successors, (191), 27 states have call predecessors, (191), 27 states have return successors, (191), 186 states have call predecessors, (191), 191 states have call successors, (191) [2025-02-06 02:13:51,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2607 transitions. [2025-02-06 02:13:51,805 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2607 transitions. Word has length 318 [2025-02-06 02:13:51,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:13:51,805 INFO L471 AbstractCegarLoop]: Abstraction has 1827 states and 2607 transitions. [2025-02-06 02:13:51,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-02-06 02:13:51,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2607 transitions. [2025-02-06 02:13:51,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-02-06 02:13:51,808 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:13:51,808 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:51,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:13:51,809 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:13:51,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:13:51,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1569144204, now seen corresponding path program 1 times [2025-02-06 02:13:51,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:13:51,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239836200] [2025-02-06 02:13:51,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:13:51,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:13:51,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-02-06 02:13:51,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-02-06 02:13:51,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:13:51,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:13:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-02-06 02:13:52,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:13:52,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239836200] [2025-02-06 02:13:52,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239836200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:13:52,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:13:52,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:13:52,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106667315] [2025-02-06 02:13:52,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:13:52,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:13:52,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:13:52,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:13:52,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:13:52,102 INFO L87 Difference]: Start difference. First operand 1827 states and 2607 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-02-06 02:13:52,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:13:52,440 INFO L93 Difference]: Finished difference Result 3842 states and 5540 transitions. [2025-02-06 02:13:52,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:13:52,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 319 [2025-02-06 02:13:52,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:13:52,451 INFO L225 Difference]: With dead ends: 3842 [2025-02-06 02:13:52,451 INFO L226 Difference]: Without dead ends: 3065 [2025-02-06 02:13:52,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:13:52,453 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 395 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:13:52,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 858 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:13:52,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2025-02-06 02:13:52,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 2155. [2025-02-06 02:13:52,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2155 states, 1936 states have (on average 1.3920454545454546) internal successors, (2695), 1941 states have internal predecessors, (2695), 191 states have call successors, (191), 27 states have call predecessors, (191), 27 states have return successors, (191), 186 states have call predecessors, (191), 191 states have call successors, (191) [2025-02-06 02:13:52,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 3077 transitions. [2025-02-06 02:13:52,535 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 3077 transitions. Word has length 319 [2025-02-06 02:13:52,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:13:52,535 INFO L471 AbstractCegarLoop]: Abstraction has 2155 states and 3077 transitions. [2025-02-06 02:13:52,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-02-06 02:13:52,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 3077 transitions. [2025-02-06 02:13:52,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-02-06 02:13:52,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:13:52,539 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:52,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 02:13:52,539 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:13:52,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:13:52,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1275741197, now seen corresponding path program 1 times [2025-02-06 02:13:52,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:13:52,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537498180] [2025-02-06 02:13:52,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:13:52,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:13:52,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-02-06 02:13:52,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-02-06 02:13:52,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:13:52,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:13:53,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 48 proven. 84 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-02-06 02:13:53,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:13:53,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537498180] [2025-02-06 02:13:53,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537498180] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:13:53,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030368669] [2025-02-06 02:13:53,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:13:53,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:13:53,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:13:53,932 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:13:53,934 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:13:54,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-02-06 02:13:54,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-02-06 02:13:54,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:13:54,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:13:54,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-06 02:13:54,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:13:56,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1878 proven. 243 refuted. 0 times theorem prover too weak. 1839 trivial. 0 not checked. [2025-02-06 02:13:56,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:13:57,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 96 proven. 165 refuted. 0 times theorem prover too weak. 3699 trivial. 0 not checked. [2025-02-06 02:13:57,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030368669] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:13:57,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:13:57,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20, 19] total 47 [2025-02-06 02:13:57,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937401123] [2025-02-06 02:13:57,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:13:57,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-02-06 02:13:57,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:13:57,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-02-06 02:13:57,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=1827, Unknown=0, NotChecked=0, Total=2162 [2025-02-06 02:13:57,557 INFO L87 Difference]: Start difference. First operand 2155 states and 3077 transitions. Second operand has 47 states, 46 states have (on average 5.195652173913044) internal successors, (239), 45 states have internal predecessors, (239), 10 states have call successors, (135), 5 states have call predecessors, (135), 9 states have return successors, (135), 10 states have call predecessors, (135), 10 states have call successors, (135) [2025-02-06 02:14:23,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:14:23,828 INFO L93 Difference]: Finished difference Result 18383 states and 26045 transitions. [2025-02-06 02:14:23,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 271 states. [2025-02-06 02:14:23,828 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 5.195652173913044) internal successors, (239), 45 states have internal predecessors, (239), 10 states have call successors, (135), 5 states have call predecessors, (135), 9 states have return successors, (135), 10 states have call predecessors, (135), 10 states have call successors, (135) Word has length 319 [2025-02-06 02:14:23,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:14:23,886 INFO L225 Difference]: With dead ends: 18383 [2025-02-06 02:14:23,886 INFO L226 Difference]: Without dead ends: 17072 [2025-02-06 02:14:23,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 958 GetRequests, 651 SyntacticMatches, 1 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41889 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=14441, Invalid=80115, Unknown=0, NotChecked=0, Total=94556 [2025-02-06 02:14:23,903 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 11433 mSDsluCounter, 10578 mSDsCounter, 0 mSdLazyCounter, 16961 mSolverCounterSat, 3755 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11484 SdHoareTripleChecker+Valid, 11322 SdHoareTripleChecker+Invalid, 20716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3755 IncrementalHoareTripleChecker+Valid, 16961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:14:23,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11484 Valid, 11322 Invalid, 20716 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3755 Valid, 16961 Invalid, 0 Unknown, 0 Unchecked, 13.4s Time] [2025-02-06 02:14:23,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17072 states. [2025-02-06 02:14:24,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17072 to 3807. [2025-02-06 02:14:24,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3807 states, 3426 states have (on average 1.4025102159953298) internal successors, (4805), 3436 states have internal predecessors, (4805), 333 states have call successors, (333), 47 states have call predecessors, (333), 47 states have return successors, (333), 323 states have call predecessors, (333), 333 states have call successors, (333) [2025-02-06 02:14:24,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3807 states to 3807 states and 5471 transitions. [2025-02-06 02:14:24,267 INFO L78 Accepts]: Start accepts. Automaton has 3807 states and 5471 transitions. Word has length 319 [2025-02-06 02:14:24,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:14:24,268 INFO L471 AbstractCegarLoop]: Abstraction has 3807 states and 5471 transitions. [2025-02-06 02:14:24,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 5.195652173913044) internal successors, (239), 45 states have internal predecessors, (239), 10 states have call successors, (135), 5 states have call predecessors, (135), 9 states have return successors, (135), 10 states have call predecessors, (135), 10 states have call successors, (135) [2025-02-06 02:14:24,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3807 states and 5471 transitions. [2025-02-06 02:14:24,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-02-06 02:14:24,275 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:14:24,276 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:24,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 02:14:24,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-06 02:14:24,481 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:14:24,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:14:24,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1398462873, now seen corresponding path program 1 times [2025-02-06 02:14:24,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:14:24,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444585822] [2025-02-06 02:14:24,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:14:24,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:14:24,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-02-06 02:14:24,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-02-06 02:14:24,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:14:24,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:14:24,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-02-06 02:14:24,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:14:24,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444585822] [2025-02-06 02:14:24,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444585822] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:14:24,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:14:24,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 02:14:24,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633813613] [2025-02-06 02:14:24,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:14:24,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:14:24,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:14:24,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:14:24,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:14:24,857 INFO L87 Difference]: Start difference. First operand 3807 states and 5471 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-02-06 02:14:25,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:14:25,617 INFO L93 Difference]: Finished difference Result 6671 states and 9538 transitions. [2025-02-06 02:14:25,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 02:14:25,617 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 320 [2025-02-06 02:14:25,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:14:25,627 INFO L225 Difference]: With dead ends: 6671 [2025-02-06 02:14:25,627 INFO L226 Difference]: Without dead ends: 4549 [2025-02-06 02:14:25,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-02-06 02:14:25,630 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 783 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:14:25,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 1303 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:14:25,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4549 states. [2025-02-06 02:14:25,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4549 to 4365. [2025-02-06 02:14:25,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4365 states, 3984 states have (on average 1.4066265060240963) internal successors, (5604), 3994 states have internal predecessors, (5604), 333 states have call successors, (333), 47 states have call predecessors, (333), 47 states have return successors, (333), 323 states have call predecessors, (333), 333 states have call successors, (333) [2025-02-06 02:14:25,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4365 states to 4365 states and 6270 transitions. [2025-02-06 02:14:25,949 INFO L78 Accepts]: Start accepts. Automaton has 4365 states and 6270 transitions. Word has length 320 [2025-02-06 02:14:25,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:14:25,949 INFO L471 AbstractCegarLoop]: Abstraction has 4365 states and 6270 transitions. [2025-02-06 02:14:25,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-02-06 02:14:25,949 INFO L276 IsEmpty]: Start isEmpty. Operand 4365 states and 6270 transitions. [2025-02-06 02:14:25,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-02-06 02:14:25,953 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:14:25,953 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:25,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 02:14:25,953 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:14:25,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:14:25,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1105059866, now seen corresponding path program 1 times [2025-02-06 02:14:25,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:14:25,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522507337] [2025-02-06 02:14:25,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:14:25,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:14:25,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-02-06 02:14:26,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-02-06 02:14:26,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:14:26,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:14:27,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-02-06 02:14:27,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:14:27,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522507337] [2025-02-06 02:14:27,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522507337] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:14:27,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:14:27,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 02:14:27,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839998073] [2025-02-06 02:14:27,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:14:27,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:14:27,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:14:27,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:14:27,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:14:27,463 INFO L87 Difference]: Start difference. First operand 4365 states and 6270 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-02-06 02:14:28,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:14:28,511 INFO L93 Difference]: Finished difference Result 6761 states and 9662 transitions. [2025-02-06 02:14:28,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:14:28,511 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 320 [2025-02-06 02:14:28,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:14:28,520 INFO L225 Difference]: With dead ends: 6761 [2025-02-06 02:14:28,520 INFO L226 Difference]: Without dead ends: 4455 [2025-02-06 02:14:28,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-02-06 02:14:28,525 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 976 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:14:28,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 1261 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 02:14:28,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4455 states. [2025-02-06 02:14:28,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4455 to 4287. [2025-02-06 02:14:28,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4287 states, 3906 states have (on average 1.4045058883768562) internal successors, (5486), 3916 states have internal predecessors, (5486), 333 states have call successors, (333), 47 states have call predecessors, (333), 47 states have return successors, (333), 323 states have call predecessors, (333), 333 states have call successors, (333) [2025-02-06 02:14:28,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6152 transitions. [2025-02-06 02:14:28,859 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6152 transitions. Word has length 320 [2025-02-06 02:14:28,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:14:28,860 INFO L471 AbstractCegarLoop]: Abstraction has 4287 states and 6152 transitions. [2025-02-06 02:14:28,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-02-06 02:14:28,860 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6152 transitions. [2025-02-06 02:14:28,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-02-06 02:14:28,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:14:28,865 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:28,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 02:14:28,865 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:14:28,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:14:28,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1418800248, now seen corresponding path program 1 times [2025-02-06 02:14:28,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:14:28,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189814918] [2025-02-06 02:14:28,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:14:28,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:14:28,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-02-06 02:14:29,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-02-06 02:14:29,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:14:29,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:14:32,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-02-06 02:14:32,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:14:32,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189814918] [2025-02-06 02:14:32,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189814918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:14:32,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:14:32,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 02:14:32,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198417647] [2025-02-06 02:14:32,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:14:32,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 02:14:32,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:14:32,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 02:14:32,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-06 02:14:32,117 INFO L87 Difference]: Start difference. First operand 4287 states and 6152 transitions. Second operand has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 3 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2025-02-06 02:14:34,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:14:34,543 INFO L93 Difference]: Finished difference Result 7289 states and 10361 transitions. [2025-02-06 02:14:34,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 02:14:34,544 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 3 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) Word has length 320 [2025-02-06 02:14:34,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:14:34,558 INFO L225 Difference]: With dead ends: 7289 [2025-02-06 02:14:34,561 INFO L226 Difference]: Without dead ends: 5207 [2025-02-06 02:14:34,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2025-02-06 02:14:34,572 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 2268 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2268 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 1667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:14:34,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2268 Valid, 1680 Invalid, 1667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1450 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-06 02:14:34,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5207 states. [2025-02-06 02:14:34,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5207 to 4469. [2025-02-06 02:14:34,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4469 states, 4088 states have (on average 1.4045988258317026) internal successors, (5742), 4098 states have internal predecessors, (5742), 333 states have call successors, (333), 47 states have call predecessors, (333), 47 states have return successors, (333), 323 states have call predecessors, (333), 333 states have call successors, (333) [2025-02-06 02:14:34,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4469 states to 4469 states and 6408 transitions. [2025-02-06 02:14:34,917 INFO L78 Accepts]: Start accepts. Automaton has 4469 states and 6408 transitions. Word has length 320 [2025-02-06 02:14:34,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:14:34,918 INFO L471 AbstractCegarLoop]: Abstraction has 4469 states and 6408 transitions. [2025-02-06 02:14:34,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 3 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2025-02-06 02:14:34,918 INFO L276 IsEmpty]: Start isEmpty. Operand 4469 states and 6408 transitions. [2025-02-06 02:14:34,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-02-06 02:14:34,923 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:14:34,923 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:34,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 02:14:34,923 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:14:34,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:14:34,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1125397241, now seen corresponding path program 1 times [2025-02-06 02:14:34,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:14:34,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783823502] [2025-02-06 02:14:34,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:14:34,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:14:34,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-02-06 02:14:35,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-02-06 02:14:35,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:14:35,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:14:35,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 105 proven. 27 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-02-06 02:14:35,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:14:35,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783823502] [2025-02-06 02:14:35,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783823502] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:14:35,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626387644] [2025-02-06 02:14:35,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:14:35,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:14:35,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:14:35,324 INFO L229 MonitoredProcess]: Starting monitored process 6 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:14:35,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 02:14:35,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-02-06 02:14:35,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-02-06 02:14:35,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:14:35,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:14:35,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:14:35,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:14:35,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1374 proven. 27 refuted. 0 times theorem prover too weak. 2559 trivial. 0 not checked. [2025-02-06 02:14:35,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:14:35,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 105 proven. 27 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-02-06 02:14:35,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626387644] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:14:35,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:14:35,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-06 02:14:35,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529456301] [2025-02-06 02:14:35,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:14:35,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:14:35,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:14:35,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:14:35,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:14:35,800 INFO L87 Difference]: Start difference. First operand 4469 states and 6408 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-02-06 02:14:36,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:14:36,339 INFO L93 Difference]: Finished difference Result 8655 states and 12408 transitions. [2025-02-06 02:14:36,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:14:36,339 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 320 [2025-02-06 02:14:36,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:14:36,358 INFO L225 Difference]: With dead ends: 8655 [2025-02-06 02:14:36,358 INFO L226 Difference]: Without dead ends: 4527 [2025-02-06 02:14:36,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 637 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:14:36,363 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 179 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:14:36,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 705 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:14:36,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4527 states. [2025-02-06 02:14:36,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4527 to 4489. [2025-02-06 02:14:36,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4489 states, 4103 states have (on average 1.3987326346575677) internal successors, (5739), 4113 states have internal predecessors, (5739), 333 states have call successors, (333), 52 states have call predecessors, (333), 52 states have return successors, (333), 323 states have call predecessors, (333), 333 states have call successors, (333) [2025-02-06 02:14:36,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4489 states to 4489 states and 6405 transitions. [2025-02-06 02:14:36,591 INFO L78 Accepts]: Start accepts. Automaton has 4489 states and 6405 transitions. Word has length 320 [2025-02-06 02:14:36,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:14:36,592 INFO L471 AbstractCegarLoop]: Abstraction has 4489 states and 6405 transitions. [2025-02-06 02:14:36,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-02-06 02:14:36,592 INFO L276 IsEmpty]: Start isEmpty. Operand 4489 states and 6405 transitions. [2025-02-06 02:14:36,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-02-06 02:14:36,595 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:14:36,595 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:36,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 02:14:36,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 02:14:36,796 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:14:36,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:14:36,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1100560732, now seen corresponding path program 1 times [2025-02-06 02:14:36,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:14:36,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084707770] [2025-02-06 02:14:36,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:14:36,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:14:36,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-02-06 02:14:36,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-02-06 02:14:36,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:14:36,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:14:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-02-06 02:14:42,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:14:42,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084707770] [2025-02-06 02:14:42,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084707770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:14:42,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:14:42,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 02:14:42,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314905150] [2025-02-06 02:14:42,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:14:42,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 02:14:42,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:14:42,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 02:14:42,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-06 02:14:42,879 INFO L87 Difference]: Start difference. First operand 4489 states and 6405 transitions. Second operand has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 12 states have internal predecessors, (98), 2 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45)