./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c --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/bitvector/soft_float_1-2a.c.cil.c -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 c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:38:32,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:38:32,116 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:38:32,127 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:38:32,128 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:38:32,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:38:32,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:38:32,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:38:32,161 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:38:32,161 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:38:32,162 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:38:32,162 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:38:32,163 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:38:32,163 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:38:32,163 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:38:32,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:38:32,164 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:38:32,164 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:38:32,164 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:38:32,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:38:32,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:38:32,164 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:38:32,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:38:32,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:38:32,165 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:38:32,165 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:38:32,165 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:38:32,165 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:38:32,165 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:38:32,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:38:32,166 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:38:32,166 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:38:32,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:38:32,167 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:38:32,167 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:38:32,167 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:38:32,167 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:38:32,167 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:38:32,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:38:32,167 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:38:32,167 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:38:32,168 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:38:32,168 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:38:32,168 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 -> c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 [2025-02-05 10:38:32,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:38:32,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:38:32,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:38:32,508 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:38:32,510 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:38:32,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2025-02-05 10:38:33,852 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1595f8e13/ab5bf084d2b842cc8895965193519710/FLAG171e12268 [2025-02-05 10:38:34,125 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:38:34,126 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2025-02-05 10:38:34,134 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1595f8e13/ab5bf084d2b842cc8895965193519710/FLAG171e12268 [2025-02-05 10:38:34,429 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1595f8e13/ab5bf084d2b842cc8895965193519710 [2025-02-05 10:38:34,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:38:34,433 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:38:34,434 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:38:34,434 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:38:34,438 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:38:34,438 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:38:34" (1/1) ... [2025-02-05 10:38:34,439 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c5c60b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:34, skipping insertion in model container [2025-02-05 10:38:34,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:38:34" (1/1) ... [2025-02-05 10:38:34,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:38:34,572 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/bitvector/soft_float_1-2a.c.cil.c[755,768] [2025-02-05 10:38:34,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:38:34,637 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:38:34,644 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/bitvector/soft_float_1-2a.c.cil.c[755,768] [2025-02-05 10:38:34,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:38:34,681 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:38:34,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:34 WrapperNode [2025-02-05 10:38:34,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:38:34,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:38:34,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:38:34,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:38:34,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:34" (1/1) ... [2025-02-05 10:38:34,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:34" (1/1) ... [2025-02-05 10:38:34,734 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 190 [2025-02-05 10:38:34,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:38:34,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:38:34,735 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:38:34,735 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:38:34,746 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:34" (1/1) ... [2025-02-05 10:38:34,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:34" (1/1) ... [2025-02-05 10:38:34,748 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:34" (1/1) ... [2025-02-05 10:38:34,770 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-05 10:38:34,770 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:34" (1/1) ... [2025-02-05 10:38:34,770 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:34" (1/1) ... [2025-02-05 10:38:34,778 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:34" (1/1) ... [2025-02-05 10:38:34,779 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:34" (1/1) ... [2025-02-05 10:38:34,780 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:34" (1/1) ... [2025-02-05 10:38:34,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:34" (1/1) ... [2025-02-05 10:38:34,783 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:38:34,784 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:38:34,784 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:38:34,784 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:38:34,785 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:34" (1/1) ... [2025-02-05 10:38:34,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:38:34,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:34,818 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-05 10:38:34,824 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-05 10:38:34,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:38:34,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:38:34,844 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-02-05 10:38:34,844 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-02-05 10:38:34,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:38:34,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:38:34,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-05 10:38:34,845 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-05 10:38:34,919 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:38:34,921 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:38:35,338 INFO L? ?]: Removed 74 outVars from TransFormulas that were not future-live. [2025-02-05 10:38:35,338 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:38:35,363 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:38:35,364 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-05 10:38:35,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:38:35 BoogieIcfgContainer [2025-02-05 10:38:35,365 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:38:35,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:38:35,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:38:35,370 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:38:35,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:38:34" (1/3) ... [2025-02-05 10:38:35,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cfc3f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:38:35, skipping insertion in model container [2025-02-05 10:38:35,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:34" (2/3) ... [2025-02-05 10:38:35,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cfc3f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:38:35, skipping insertion in model container [2025-02-05 10:38:35,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:38:35" (3/3) ... [2025-02-05 10:38:35,373 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2025-02-05 10:38:35,388 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:38:35,389 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_1-2a.c.cil.c that has 3 procedures, 97 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 10:38:35,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:38:35,456 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;@ecb0ae9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:38:35,457 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:38:35,460 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 84 states have (on average 1.5595238095238095) internal successors, (131), 88 states have internal predecessors, (131), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 10:38:35,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 10:38:35,468 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:35,469 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-05 10:38:35,470 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:35,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:35,474 INFO L85 PathProgramCache]: Analyzing trace with hash 438656228, now seen corresponding path program 1 times [2025-02-05 10:38:35,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:35,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900268267] [2025-02-05 10:38:35,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:35,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:35,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 10:38:35,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 10:38:35,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:35,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:36,095 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:36,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:36,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900268267] [2025-02-05 10:38:36,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900268267] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:36,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249366840] [2025-02-05 10:38:36,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:36,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:36,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:36,103 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-05 10:38:36,105 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-05 10:38:36,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 10:38:36,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 10:38:36,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:36,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:36,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 10:38:36,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:36,284 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:36,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:38:36,444 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:36,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249366840] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:38:36,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:38:36,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2025-02-05 10:38:36,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542822072] [2025-02-05 10:38:36,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:38:36,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 10:38:36,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:36,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 10:38:36,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-02-05 10:38:36,479 INFO L87 Difference]: Start difference. First operand has 97 states, 84 states have (on average 1.5595238095238095) internal successors, (131), 88 states have internal predecessors, (131), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 11 states have internal predecessors, (39), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-05 10:38:36,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:36,877 INFO L93 Difference]: Finished difference Result 273 states and 442 transitions. [2025-02-05 10:38:36,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 10:38:36,879 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 11 states have internal predecessors, (39), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) Word has length 36 [2025-02-05 10:38:36,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:36,888 INFO L225 Difference]: With dead ends: 273 [2025-02-05 10:38:36,889 INFO L226 Difference]: Without dead ends: 172 [2025-02-05 10:38:36,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2025-02-05 10:38:36,895 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 119 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:36,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1152 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:38:36,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-02-05 10:38:36,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 163. [2025-02-05 10:38:36,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 143 states have (on average 1.4265734265734267) internal successors, (204), 144 states have internal predecessors, (204), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 18 states have call predecessors, (22), 15 states have call successors, (22) [2025-02-05 10:38:36,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2025-02-05 10:38:36,946 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 36 [2025-02-05 10:38:36,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:36,947 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2025-02-05 10:38:36,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 11 states have internal predecessors, (39), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-05 10:38:36,947 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2025-02-05 10:38:36,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-05 10:38:36,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:36,951 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 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-05 10:38:36,958 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-05 10:38:37,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 10:38:37,155 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:37,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:37,156 INFO L85 PathProgramCache]: Analyzing trace with hash 352161122, now seen corresponding path program 1 times [2025-02-05 10:38:37,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:37,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196864208] [2025-02-05 10:38:37,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:37,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:37,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-05 10:38:37,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 10:38:37,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:37,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:37,418 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:37,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:37,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196864208] [2025-02-05 10:38:37,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196864208] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:37,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:37,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 10:38:37,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023397879] [2025-02-05 10:38:37,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:37,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 10:38:37,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:37,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 10:38:37,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:38:37,421 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:37,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:37,556 INFO L93 Difference]: Finished difference Result 332 states and 495 transitions. [2025-02-05 10:38:37,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 10:38:37,557 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2025-02-05 10:38:37,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:37,559 INFO L225 Difference]: With dead ends: 332 [2025-02-05 10:38:37,559 INFO L226 Difference]: Without dead ends: 227 [2025-02-05 10:38:37,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:38:37,561 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 33 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:37,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 672 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:37,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-02-05 10:38:37,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2025-02-05 10:38:37,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 201 states have (on average 1.4029850746268657) internal successors, (282), 200 states have internal predecessors, (282), 20 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (26), 26 states have call predecessors, (26), 19 states have call successors, (26) [2025-02-05 10:38:37,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 328 transitions. [2025-02-05 10:38:37,588 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 328 transitions. Word has length 40 [2025-02-05 10:38:37,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:37,588 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 328 transitions. [2025-02-05 10:38:37,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:37,590 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 328 transitions. [2025-02-05 10:38:37,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 10:38:37,594 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:37,594 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:37,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:38:37,595 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:37,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:37,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1817944966, now seen corresponding path program 1 times [2025-02-05 10:38:37,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:37,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820720401] [2025-02-05 10:38:37,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:37,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:37,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 10:38:37,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 10:38:37,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:37,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:38:37,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:37,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820720401] [2025-02-05 10:38:37,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820720401] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:37,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:37,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:38:37,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598923178] [2025-02-05 10:38:37,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:37,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:38:37,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:37,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:38:37,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:38:37,711 INFO L87 Difference]: Start difference. First operand 225 states and 328 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:37,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:37,770 INFO L93 Difference]: Finished difference Result 388 states and 567 transitions. [2025-02-05 10:38:37,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:38:37,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2025-02-05 10:38:37,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:37,773 INFO L225 Difference]: With dead ends: 388 [2025-02-05 10:38:37,773 INFO L226 Difference]: Without dead ends: 322 [2025-02-05 10:38:37,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:38:37,774 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 39 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:37,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 464 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:37,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-02-05 10:38:37,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2025-02-05 10:38:37,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 294 states have (on average 1.370748299319728) internal successors, (403), 293 states have internal predecessors, (403), 24 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (30), 30 states have call predecessors, (30), 23 states have call successors, (30) [2025-02-05 10:38:37,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 457 transitions. [2025-02-05 10:38:37,792 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 457 transitions. Word has length 43 [2025-02-05 10:38:37,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:37,792 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 457 transitions. [2025-02-05 10:38:37,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:37,792 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 457 transitions. [2025-02-05 10:38:37,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 10:38:37,794 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:37,794 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:37,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:38:37,794 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:37,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:37,795 INFO L85 PathProgramCache]: Analyzing trace with hash -2049606924, now seen corresponding path program 1 times [2025-02-05 10:38:37,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:37,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40370025] [2025-02-05 10:38:37,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:37,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:37,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 10:38:37,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 10:38:37,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:37,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:37,866 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 10:38:37,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:37,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40370025] [2025-02-05 10:38:37,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40370025] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:37,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607755335] [2025-02-05 10:38:37,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:37,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:37,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:37,869 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-05 10:38:37,871 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-05 10:38:37,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 10:38:37,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 10:38:37,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:37,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:37,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:38:37,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:37,957 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:38:37,957 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:37,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607755335] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:37,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:38:37,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 10:38:37,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551219573] [2025-02-05 10:38:37,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:37,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:37,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:37,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:37,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:38:37,959 INFO L87 Difference]: Start difference. First operand 322 states and 457 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:37,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:37,996 INFO L93 Difference]: Finished difference Result 416 states and 597 transitions. [2025-02-05 10:38:37,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:37,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2025-02-05 10:38:37,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:37,999 INFO L225 Difference]: With dead ends: 416 [2025-02-05 10:38:37,999 INFO L226 Difference]: Without dead ends: 350 [2025-02-05 10:38:38,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:38:38,001 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 41 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:38,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 247 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:38,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-02-05 10:38:38,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2025-02-05 10:38:38,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 324 states have (on average 1.3487654320987654) internal successors, (437), 321 states have internal predecessors, (437), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (28), 28 states have call predecessors, (28), 21 states have call successors, (28) [2025-02-05 10:38:38,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 487 transitions. [2025-02-05 10:38:38,024 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 487 transitions. Word has length 43 [2025-02-05 10:38:38,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:38,026 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 487 transitions. [2025-02-05 10:38:38,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:38,026 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 487 transitions. [2025-02-05 10:38:38,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 10:38:38,027 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:38,028 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:38,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 10:38:38,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:38,229 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:38,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:38,230 INFO L85 PathProgramCache]: Analyzing trace with hash -891546516, now seen corresponding path program 1 times [2025-02-05 10:38:38,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:38,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520394404] [2025-02-05 10:38:38,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:38,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:38,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 10:38:38,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 10:38:38,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:38,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:38,287 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:38:38,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:38,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520394404] [2025-02-05 10:38:38,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520394404] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:38,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:38,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:38:38,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356040958] [2025-02-05 10:38:38,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:38,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:38:38,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:38,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:38:38,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:38:38,289 INFO L87 Difference]: Start difference. First operand 350 states and 487 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:38,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:38,329 INFO L93 Difference]: Finished difference Result 361 states and 499 transitions. [2025-02-05 10:38:38,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:38:38,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-02-05 10:38:38,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:38,332 INFO L225 Difference]: With dead ends: 361 [2025-02-05 10:38:38,335 INFO L226 Difference]: Without dead ends: 354 [2025-02-05 10:38:38,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:38:38,337 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:38,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 372 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:38,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-02-05 10:38:38,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-02-05 10:38:38,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 328 states have (on average 1.3445121951219512) internal successors, (441), 325 states have internal predecessors, (441), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (28), 28 states have call predecessors, (28), 21 states have call successors, (28) [2025-02-05 10:38:38,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 491 transitions. [2025-02-05 10:38:38,355 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 491 transitions. Word has length 44 [2025-02-05 10:38:38,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:38,355 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 491 transitions. [2025-02-05 10:38:38,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:38,356 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 491 transitions. [2025-02-05 10:38:38,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 10:38:38,357 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:38,358 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:38,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 10:38:38,358 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:38,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:38,358 INFO L85 PathProgramCache]: Analyzing trace with hash -4042835, now seen corresponding path program 1 times [2025-02-05 10:38:38,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:38,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868236992] [2025-02-05 10:38:38,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:38,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:38,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 10:38:38,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 10:38:38,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:38,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:38,444 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:38:38,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:38,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868236992] [2025-02-05 10:38:38,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868236992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:38,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:38,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 10:38:38,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881540297] [2025-02-05 10:38:38,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:38,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 10:38:38,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:38,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 10:38:38,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:38:38,446 INFO L87 Difference]: Start difference. First operand 354 states and 491 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:38,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:38,516 INFO L93 Difference]: Finished difference Result 361 states and 497 transitions. [2025-02-05 10:38:38,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:38:38,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-02-05 10:38:38,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:38,518 INFO L225 Difference]: With dead ends: 361 [2025-02-05 10:38:38,518 INFO L226 Difference]: Without dead ends: 354 [2025-02-05 10:38:38,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:38:38,520 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 3 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:38,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 495 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:38,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-02-05 10:38:38,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 350. [2025-02-05 10:38:38,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 324 states have (on average 1.3395061728395061) internal successors, (434), 321 states have internal predecessors, (434), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (28), 28 states have call predecessors, (28), 21 states have call successors, (28) [2025-02-05 10:38:38,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 484 transitions. [2025-02-05 10:38:38,536 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 484 transitions. Word has length 44 [2025-02-05 10:38:38,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:38,537 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 484 transitions. [2025-02-05 10:38:38,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:38,538 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 484 transitions. [2025-02-05 10:38:38,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 10:38:38,540 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:38,542 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:38,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 10:38:38,542 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:38,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:38,543 INFO L85 PathProgramCache]: Analyzing trace with hash -741507704, now seen corresponding path program 1 times [2025-02-05 10:38:38,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:38,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759112208] [2025-02-05 10:38:38,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:38,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:38,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 10:38:38,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 10:38:38,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:38,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:38,763 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:38,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:38,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759112208] [2025-02-05 10:38:38,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759112208] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:38,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789987882] [2025-02-05 10:38:38,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:38,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:38,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:38,768 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-05 10:38:38,770 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-05 10:38:38,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 10:38:38,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 10:38:38,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:38,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:38,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-05 10:38:38,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:38,975 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:38:38,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:38:39,103 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:38:39,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789987882] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:39,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:38:39,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 11] total 16 [2025-02-05 10:38:39,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257587212] [2025-02-05 10:38:39,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:39,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 10:38:39,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:39,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 10:38:39,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-02-05 10:38:39,105 INFO L87 Difference]: Start difference. First operand 350 states and 484 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:39,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:39,266 INFO L93 Difference]: Finished difference Result 581 states and 802 transitions. [2025-02-05 10:38:39,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:38:39,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-02-05 10:38:39,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:39,269 INFO L225 Difference]: With dead ends: 581 [2025-02-05 10:38:39,269 INFO L226 Difference]: Without dead ends: 439 [2025-02-05 10:38:39,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-02-05 10:38:39,272 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 45 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:39,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 514 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:39,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-02-05 10:38:39,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 362. [2025-02-05 10:38:39,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 336 states have (on average 1.3273809523809523) internal successors, (446), 333 states have internal predecessors, (446), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (28), 28 states have call predecessors, (28), 21 states have call successors, (28) [2025-02-05 10:38:39,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 496 transitions. [2025-02-05 10:38:39,292 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 496 transitions. Word has length 44 [2025-02-05 10:38:39,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:39,294 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 496 transitions. [2025-02-05 10:38:39,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:39,296 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 496 transitions. [2025-02-05 10:38:39,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 10:38:39,297 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:39,297 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:39,307 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-05 10:38:39,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:39,498 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:39,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:39,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1034910711, now seen corresponding path program 1 times [2025-02-05 10:38:39,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:39,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052939000] [2025-02-05 10:38:39,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:39,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:39,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 10:38:39,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 10:38:39,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:39,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:39,721 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:38:39,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:39,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052939000] [2025-02-05 10:38:39,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052939000] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:39,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791354440] [2025-02-05 10:38:39,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:39,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:39,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:39,723 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-05 10:38:39,725 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-05 10:38:39,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 10:38:39,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 10:38:39,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:39,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:39,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-05 10:38:39,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:39,825 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:38:39,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:38:40,029 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:38:40,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791354440] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:38:40,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:38:40,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 19 [2025-02-05 10:38:40,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875230682] [2025-02-05 10:38:40,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:38:40,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 10:38:40,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:40,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 10:38:40,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-02-05 10:38:40,031 INFO L87 Difference]: Start difference. First operand 362 states and 496 transitions. Second operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 15 states have internal predecessors, (49), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 10:38:40,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:40,276 INFO L93 Difference]: Finished difference Result 521 states and 722 transitions. [2025-02-05 10:38:40,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 10:38:40,277 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 15 states have internal predecessors, (49), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 44 [2025-02-05 10:38:40,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:40,280 INFO L225 Difference]: With dead ends: 521 [2025-02-05 10:38:40,280 INFO L226 Difference]: Without dead ends: 392 [2025-02-05 10:38:40,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-02-05 10:38:40,281 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 11 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:40,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1673 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:38:40,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-05 10:38:40,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 380. [2025-02-05 10:38:40,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 353 states have (on average 1.3144475920679888) internal successors, (464), 349 states have internal predecessors, (464), 22 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (35), 30 states have call predecessors, (35), 21 states have call successors, (35) [2025-02-05 10:38:40,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 521 transitions. [2025-02-05 10:38:40,300 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 521 transitions. Word has length 44 [2025-02-05 10:38:40,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:40,300 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 521 transitions. [2025-02-05 10:38:40,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 15 states have internal predecessors, (49), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 10:38:40,300 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 521 transitions. [2025-02-05 10:38:40,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 10:38:40,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:40,302 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 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-05 10:38:40,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 10:38:40,502 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,SelfDestructingSolverStorable7 [2025-02-05 10:38:40,503 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:40,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:40,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1145522127, now seen corresponding path program 1 times [2025-02-05 10:38:40,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:40,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886301820] [2025-02-05 10:38:40,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:40,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:40,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 10:38:40,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 10:38:40,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:40,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:40,553 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 10:38:40,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:40,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886301820] [2025-02-05 10:38:40,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886301820] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:40,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153374980] [2025-02-05 10:38:40,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:40,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:40,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:40,556 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-05 10:38:40,559 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-05 10:38:40,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 10:38:40,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 10:38:40,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:40,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:40,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:38:40,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:40,634 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 10:38:40,634 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:40,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153374980] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:40,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:38:40,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-05 10:38:40,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942274033] [2025-02-05 10:38:40,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:40,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:38:40,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:40,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:38:40,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:38:40,636 INFO L87 Difference]: Start difference. First operand 380 states and 521 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:38:40,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:40,697 INFO L93 Difference]: Finished difference Result 727 states and 1007 transitions. [2025-02-05 10:38:40,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:38:40,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2025-02-05 10:38:40,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:40,701 INFO L225 Difference]: With dead ends: 727 [2025-02-05 10:38:40,701 INFO L226 Difference]: Without dead ends: 389 [2025-02-05 10:38:40,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:38:40,702 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 15 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:40,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 330 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:40,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-02-05 10:38:40,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 386. [2025-02-05 10:38:40,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 358 states have (on average 1.312849162011173) internal successors, (470), 355 states have internal predecessors, (470), 22 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (41), 30 states have call predecessors, (41), 21 states have call successors, (41) [2025-02-05 10:38:40,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 533 transitions. [2025-02-05 10:38:40,716 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 533 transitions. Word has length 44 [2025-02-05 10:38:40,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:40,716 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 533 transitions. [2025-02-05 10:38:40,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:38:40,717 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 533 transitions. [2025-02-05 10:38:40,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 10:38:40,718 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:40,718 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:40,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 10:38:40,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:40,919 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:40,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:40,919 INFO L85 PathProgramCache]: Analyzing trace with hash -137961380, now seen corresponding path program 1 times [2025-02-05 10:38:40,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:40,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266398837] [2025-02-05 10:38:40,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:40,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:40,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 10:38:40,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 10:38:40,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:40,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:40,983 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:38:40,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:40,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266398837] [2025-02-05 10:38:40,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266398837] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:40,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:40,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:38:40,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571597586] [2025-02-05 10:38:40,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:40,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:38:40,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:40,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:38:40,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:38:40,985 INFO L87 Difference]: Start difference. First operand 386 states and 533 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:41,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:41,029 INFO L93 Difference]: Finished difference Result 615 states and 848 transitions. [2025-02-05 10:38:41,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:38:41,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2025-02-05 10:38:41,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:41,033 INFO L225 Difference]: With dead ends: 615 [2025-02-05 10:38:41,033 INFO L226 Difference]: Without dead ends: 575 [2025-02-05 10:38:41,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:38:41,034 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 52 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:41,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 433 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:41,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-02-05 10:38:41,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 427. [2025-02-05 10:38:41,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 397 states have (on average 1.3173803526448362) internal successors, (523), 394 states have internal predecessors, (523), 24 states have call successors, (24), 2 states have call predecessors, (24), 5 states have return successors, (43), 32 states have call predecessors, (43), 23 states have call successors, (43) [2025-02-05 10:38:41,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 590 transitions. [2025-02-05 10:38:41,053 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 590 transitions. Word has length 45 [2025-02-05 10:38:41,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:41,053 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 590 transitions. [2025-02-05 10:38:41,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:41,054 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 590 transitions. [2025-02-05 10:38:41,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 10:38:41,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:41,055 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 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-05 10:38:41,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 10:38:41,056 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:41,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:41,056 INFO L85 PathProgramCache]: Analyzing trace with hash 935842478, now seen corresponding path program 1 times [2025-02-05 10:38:41,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:41,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236431469] [2025-02-05 10:38:41,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:41,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:41,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 10:38:41,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 10:38:41,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:41,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:41,150 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 10:38:41,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:41,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236431469] [2025-02-05 10:38:41,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236431469] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:41,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726874703] [2025-02-05 10:38:41,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:41,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:41,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:41,153 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:41,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 10:38:41,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 10:38:41,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 10:38:41,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:41,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:41,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 10:38:41,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:41,243 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 10:38:41,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:38:41,331 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 10:38:41,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726874703] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:38:41,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:38:41,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-05 10:38:41,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068521159] [2025-02-05 10:38:41,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:38:41,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 10:38:41,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:41,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 10:38:41,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 10:38:41,332 INFO L87 Difference]: Start difference. First operand 427 states and 590 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 10:38:41,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:41,458 INFO L93 Difference]: Finished difference Result 874 states and 1225 transitions. [2025-02-05 10:38:41,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 10:38:41,459 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2025-02-05 10:38:41,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:41,462 INFO L225 Difference]: With dead ends: 874 [2025-02-05 10:38:41,462 INFO L226 Difference]: Without dead ends: 450 [2025-02-05 10:38:41,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-02-05 10:38:41,464 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 37 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:41,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 568 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:41,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-02-05 10:38:41,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 441. [2025-02-05 10:38:41,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 410 states have (on average 1.3170731707317074) internal successors, (540), 408 states have internal predecessors, (540), 24 states have call successors, (24), 2 states have call predecessors, (24), 6 states have return successors, (49), 32 states have call predecessors, (49), 23 states have call successors, (49) [2025-02-05 10:38:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 613 transitions. [2025-02-05 10:38:41,484 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 613 transitions. Word has length 47 [2025-02-05 10:38:41,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:41,484 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 613 transitions. [2025-02-05 10:38:41,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 10:38:41,485 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 613 transitions. [2025-02-05 10:38:41,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 10:38:41,486 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:41,486 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:41,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 10:38:41,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 10:38:41,688 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:41,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:41,688 INFO L85 PathProgramCache]: Analyzing trace with hash -977681264, now seen corresponding path program 1 times [2025-02-05 10:38:41,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:41,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394338544] [2025-02-05 10:38:41,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:41,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:41,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 10:38:41,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 10:38:41,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:41,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:41,871 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:41,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:41,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394338544] [2025-02-05 10:38:41,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394338544] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:41,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744816752] [2025-02-05 10:38:41,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:41,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:41,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:41,874 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:41,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 10:38:41,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 10:38:41,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 10:38:41,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:41,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:41,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 10:38:41,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:42,011 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:42,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:38:42,119 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:38:42,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744816752] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:42,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:38:42,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 11] total 15 [2025-02-05 10:38:42,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668437202] [2025-02-05 10:38:42,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:42,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 10:38:42,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:42,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 10:38:42,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-02-05 10:38:42,121 INFO L87 Difference]: Start difference. First operand 441 states and 613 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:42,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:42,274 INFO L93 Difference]: Finished difference Result 635 states and 885 transitions. [2025-02-05 10:38:42,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 10:38:42,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-02-05 10:38:42,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:42,278 INFO L225 Difference]: With dead ends: 635 [2025-02-05 10:38:42,278 INFO L226 Difference]: Without dead ends: 599 [2025-02-05 10:38:42,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-02-05 10:38:42,280 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 49 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:42,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 494 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:42,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-02-05 10:38:42,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 543. [2025-02-05 10:38:42,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 506 states have (on average 1.308300395256917) internal successors, (662), 505 states have internal predecessors, (662), 30 states have call successors, (30), 2 states have call predecessors, (30), 6 states have return successors, (55), 38 states have call predecessors, (55), 29 states have call successors, (55) [2025-02-05 10:38:42,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 747 transitions. [2025-02-05 10:38:42,303 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 747 transitions. Word has length 48 [2025-02-05 10:38:42,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:42,304 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 747 transitions. [2025-02-05 10:38:42,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:42,305 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 747 transitions. [2025-02-05 10:38:42,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 10:38:42,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:42,307 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:42,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 10:38:42,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:42,508 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:42,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:42,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1520334673, now seen corresponding path program 1 times [2025-02-05 10:38:42,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:42,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701478785] [2025-02-05 10:38:42,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:42,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:42,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 10:38:42,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 10:38:42,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:42,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:38:42,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:42,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701478785] [2025-02-05 10:38:42,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701478785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:42,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:42,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:38:42,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455382491] [2025-02-05 10:38:42,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:42,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:38:42,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:42,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:38:42,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:38:42,550 INFO L87 Difference]: Start difference. First operand 543 states and 747 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:42,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:42,583 INFO L93 Difference]: Finished difference Result 558 states and 763 transitions. [2025-02-05 10:38:42,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:38:42,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-02-05 10:38:42,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:42,586 INFO L225 Difference]: With dead ends: 558 [2025-02-05 10:38:42,586 INFO L226 Difference]: Without dead ends: 502 [2025-02-05 10:38:42,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:38:42,589 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:42,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 369 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:42,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-02-05 10:38:42,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2025-02-05 10:38:42,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 465 states have (on average 1.3161290322580645) internal successors, (612), 466 states have internal predecessors, (612), 30 states have call successors, (30), 2 states have call predecessors, (30), 6 states have return successors, (51), 36 states have call predecessors, (51), 29 states have call successors, (51) [2025-02-05 10:38:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 693 transitions. [2025-02-05 10:38:42,613 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 693 transitions. Word has length 48 [2025-02-05 10:38:42,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:42,613 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 693 transitions. [2025-02-05 10:38:42,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:42,614 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 693 transitions. [2025-02-05 10:38:42,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 10:38:42,615 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:42,616 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:42,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 10:38:42,616 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:42,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:42,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1906521717, now seen corresponding path program 1 times [2025-02-05 10:38:42,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:42,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779907654] [2025-02-05 10:38:42,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:42,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:42,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 10:38:42,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 10:38:42,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:42,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:42,654 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:42,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:42,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779907654] [2025-02-05 10:38:42,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779907654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:42,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:42,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:42,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089123660] [2025-02-05 10:38:42,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:42,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:42,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:42,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:42,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:42,656 INFO L87 Difference]: Start difference. First operand 502 states and 693 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:42,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:42,707 INFO L93 Difference]: Finished difference Result 991 states and 1369 transitions. [2025-02-05 10:38:42,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:42,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-02-05 10:38:42,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:42,710 INFO L225 Difference]: With dead ends: 991 [2025-02-05 10:38:42,710 INFO L226 Difference]: Without dead ends: 502 [2025-02-05 10:38:42,712 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-05 10:38:42,712 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 7 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:42,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 231 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:42,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-02-05 10:38:42,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2025-02-05 10:38:42,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 465 states have (on average 1.313978494623656) internal successors, (611), 466 states have internal predecessors, (611), 30 states have call successors, (30), 2 states have call predecessors, (30), 6 states have return successors, (51), 36 states have call predecessors, (51), 29 states have call successors, (51) [2025-02-05 10:38:42,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 692 transitions. [2025-02-05 10:38:42,730 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 692 transitions. Word has length 48 [2025-02-05 10:38:42,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:42,730 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 692 transitions. [2025-02-05 10:38:42,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:42,730 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 692 transitions. [2025-02-05 10:38:42,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 10:38:42,732 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:42,732 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-05 10:38:42,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 10:38:42,732 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:42,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:42,732 INFO L85 PathProgramCache]: Analyzing trace with hash 216185764, now seen corresponding path program 1 times [2025-02-05 10:38:42,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:42,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974341707] [2025-02-05 10:38:42,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:42,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:42,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 10:38:42,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 10:38:42,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:42,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:42,863 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 10:38:42,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:42,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974341707] [2025-02-05 10:38:42,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974341707] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:42,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983947662] [2025-02-05 10:38:42,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:42,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:42,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:42,866 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:42,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 10:38:42,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 10:38:42,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 10:38:42,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:42,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:42,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-05 10:38:42,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:42,997 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 10:38:42,998 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:42,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983947662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:42,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:38:42,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 10 [2025-02-05 10:38:42,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368860925] [2025-02-05 10:38:42,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:42,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 10:38:42,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:42,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 10:38:42,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-05 10:38:42,999 INFO L87 Difference]: Start difference. First operand 502 states and 692 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:38:43,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:43,298 INFO L93 Difference]: Finished difference Result 1156 states and 1614 transitions. [2025-02-05 10:38:43,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 10:38:43,299 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2025-02-05 10:38:43,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:43,303 INFO L225 Difference]: With dead ends: 1156 [2025-02-05 10:38:43,303 INFO L226 Difference]: Without dead ends: 898 [2025-02-05 10:38:43,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-05 10:38:43,305 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 131 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:43,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1340 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:38:43,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2025-02-05 10:38:43,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 680. [2025-02-05 10:38:43,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 632 states have (on average 1.3227848101265822) internal successors, (836), 628 states have internal predecessors, (836), 41 states have call successors, (41), 2 states have call predecessors, (41), 6 states have return successors, (70), 52 states have call predecessors, (70), 40 states have call successors, (70) [2025-02-05 10:38:43,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 947 transitions. [2025-02-05 10:38:43,339 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 947 transitions. Word has length 48 [2025-02-05 10:38:43,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:43,340 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 947 transitions. [2025-02-05 10:38:43,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:38:43,340 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 947 transitions. [2025-02-05 10:38:43,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 10:38:43,342 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:43,342 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-05 10:38:43,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-05 10:38:43,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 10:38:43,543 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:43,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:43,543 INFO L85 PathProgramCache]: Analyzing trace with hash 19672259, now seen corresponding path program 1 times [2025-02-05 10:38:43,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:43,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128765090] [2025-02-05 10:38:43,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:43,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:43,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 10:38:43,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 10:38:43,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:43,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:43,742 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 10:38:43,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:43,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128765090] [2025-02-05 10:38:43,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128765090] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:43,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:43,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 10:38:43,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400339539] [2025-02-05 10:38:43,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:43,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 10:38:43,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:43,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 10:38:43,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:38:43,744 INFO L87 Difference]: Start difference. First operand 680 states and 947 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:43,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:43,931 INFO L93 Difference]: Finished difference Result 1426 states and 2002 transitions. [2025-02-05 10:38:43,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 10:38:43,931 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-02-05 10:38:43,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:43,936 INFO L225 Difference]: With dead ends: 1426 [2025-02-05 10:38:43,936 INFO L226 Difference]: Without dead ends: 1078 [2025-02-05 10:38:43,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 10:38:43,938 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 80 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:43,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 866 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:43,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2025-02-05 10:38:43,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1068. [2025-02-05 10:38:43,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 997 states have (on average 1.3189568706118355) internal successors, (1315), 993 states have internal predecessors, (1315), 64 states have call successors, (64), 2 states have call predecessors, (64), 6 states have return successors, (93), 77 states have call predecessors, (93), 63 states have call successors, (93) [2025-02-05 10:38:43,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1472 transitions. [2025-02-05 10:38:43,971 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1472 transitions. Word has length 48 [2025-02-05 10:38:43,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:43,971 INFO L471 AbstractCegarLoop]: Abstraction has 1068 states and 1472 transitions. [2025-02-05 10:38:43,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:43,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1472 transitions. [2025-02-05 10:38:43,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-05 10:38:43,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:43,973 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:43,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 10:38:43,973 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:43,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:43,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1127174390, now seen corresponding path program 1 times [2025-02-05 10:38:43,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:43,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694209515] [2025-02-05 10:38:43,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:43,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:43,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-05 10:38:43,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 10:38:43,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:43,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:44,037 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:44,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:44,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694209515] [2025-02-05 10:38:44,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694209515] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:44,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:44,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:38:44,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977247012] [2025-02-05 10:38:44,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:44,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:38:44,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:44,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:38:44,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:38:44,038 INFO L87 Difference]: Start difference. First operand 1068 states and 1472 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:44,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:44,115 INFO L93 Difference]: Finished difference Result 2118 states and 2925 transitions. [2025-02-05 10:38:44,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:38:44,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2025-02-05 10:38:44,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:44,121 INFO L225 Difference]: With dead ends: 2118 [2025-02-05 10:38:44,121 INFO L226 Difference]: Without dead ends: 1071 [2025-02-05 10:38:44,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:38:44,125 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 9 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:44,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 353 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:44,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2025-02-05 10:38:44,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1068. [2025-02-05 10:38:44,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 997 states have (on average 1.3179538615847544) internal successors, (1314), 993 states have internal predecessors, (1314), 64 states have call successors, (64), 2 states have call predecessors, (64), 6 states have return successors, (93), 77 states have call predecessors, (93), 63 states have call successors, (93) [2025-02-05 10:38:44,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1471 transitions. [2025-02-05 10:38:44,165 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1471 transitions. Word has length 49 [2025-02-05 10:38:44,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:44,165 INFO L471 AbstractCegarLoop]: Abstraction has 1068 states and 1471 transitions. [2025-02-05 10:38:44,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:44,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1471 transitions. [2025-02-05 10:38:44,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 10:38:44,180 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:44,180 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:44,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 10:38:44,180 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:44,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:44,181 INFO L85 PathProgramCache]: Analyzing trace with hash 675523716, now seen corresponding path program 1 times [2025-02-05 10:38:44,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:44,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130127825] [2025-02-05 10:38:44,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:44,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:44,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 10:38:44,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 10:38:44,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:44,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:44,333 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:44,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:44,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130127825] [2025-02-05 10:38:44,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130127825] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:44,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656259767] [2025-02-05 10:38:44,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:44,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:44,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:44,336 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:44,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 10:38:44,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 10:38:44,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 10:38:44,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:44,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:44,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 10:38:44,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:44,450 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:44,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:38:44,567 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:44,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656259767] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:38:44,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:38:44,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-02-05 10:38:44,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561865193] [2025-02-05 10:38:44,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:38:44,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 10:38:44,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:44,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 10:38:44,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-02-05 10:38:44,569 INFO L87 Difference]: Start difference. First operand 1068 states and 1471 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 12 states have internal predecessors, (54), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 10:38:44,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:44,761 INFO L93 Difference]: Finished difference Result 1109 states and 1514 transitions. [2025-02-05 10:38:44,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 10:38:44,761 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 12 states have internal predecessors, (54), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2025-02-05 10:38:44,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:44,766 INFO L225 Difference]: With dead ends: 1109 [2025-02-05 10:38:44,766 INFO L226 Difference]: Without dead ends: 962 [2025-02-05 10:38:44,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-02-05 10:38:44,767 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 14 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:44,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1221 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:44,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2025-02-05 10:38:44,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 948. [2025-02-05 10:38:44,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 885 states have (on average 1.3152542372881355) internal successors, (1164), 881 states have internal predecessors, (1164), 56 states have call successors, (56), 2 states have call predecessors, (56), 6 states have return successors, (85), 69 states have call predecessors, (85), 55 states have call successors, (85) [2025-02-05 10:38:44,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1305 transitions. [2025-02-05 10:38:44,800 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1305 transitions. Word has length 50 [2025-02-05 10:38:44,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:44,801 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1305 transitions. [2025-02-05 10:38:44,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 12 states have internal predecessors, (54), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 10:38:44,801 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1305 transitions. [2025-02-05 10:38:44,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 10:38:44,802 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:44,802 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:44,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-05 10:38:45,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 10:38:45,003 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:45,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:45,004 INFO L85 PathProgramCache]: Analyzing trace with hash -2023798407, now seen corresponding path program 1 times [2025-02-05 10:38:45,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:45,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354836827] [2025-02-05 10:38:45,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:45,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:45,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 10:38:45,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 10:38:45,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:45,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:45,180 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:38:45,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:45,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354836827] [2025-02-05 10:38:45,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354836827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:45,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:45,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 10:38:45,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109495567] [2025-02-05 10:38:45,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:45,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 10:38:45,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:45,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 10:38:45,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:38:45,181 INFO L87 Difference]: Start difference. First operand 948 states and 1305 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:45,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:45,519 INFO L93 Difference]: Finished difference Result 1292 states and 1806 transitions. [2025-02-05 10:38:45,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 10:38:45,520 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2025-02-05 10:38:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:45,525 INFO L225 Difference]: With dead ends: 1292 [2025-02-05 10:38:45,525 INFO L226 Difference]: Without dead ends: 1257 [2025-02-05 10:38:45,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:38:45,527 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 64 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:45,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 897 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:38:45,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2025-02-05 10:38:45,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1044. [2025-02-05 10:38:45,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 974 states have (on average 1.3151950718685832) internal successors, (1281), 970 states have internal predecessors, (1281), 63 states have call successors, (63), 2 states have call predecessors, (63), 6 states have return successors, (92), 76 states have call predecessors, (92), 62 states have call successors, (92) [2025-02-05 10:38:45,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1436 transitions. [2025-02-05 10:38:45,564 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1436 transitions. Word has length 50 [2025-02-05 10:38:45,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:45,564 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1436 transitions. [2025-02-05 10:38:45,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:45,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1436 transitions. [2025-02-05 10:38:45,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 10:38:45,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:45,566 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:45,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 10:38:45,566 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:45,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:45,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1992667090, now seen corresponding path program 1 times [2025-02-05 10:38:45,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:45,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426808192] [2025-02-05 10:38:45,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:45,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:45,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 10:38:45,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 10:38:45,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:45,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:45,602 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:38:45,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:45,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426808192] [2025-02-05 10:38:45,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426808192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:45,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:45,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:38:45,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195831454] [2025-02-05 10:38:45,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:45,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:38:45,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:45,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:38:45,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:38:45,603 INFO L87 Difference]: Start difference. First operand 1044 states and 1436 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:45,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:45,654 INFO L93 Difference]: Finished difference Result 1095 states and 1502 transitions. [2025-02-05 10:38:45,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:38:45,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2025-02-05 10:38:45,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:45,659 INFO L225 Difference]: With dead ends: 1095 [2025-02-05 10:38:45,659 INFO L226 Difference]: Without dead ends: 1044 [2025-02-05 10:38:45,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:38:45,661 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 51 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:45,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 411 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:45,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2025-02-05 10:38:45,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 1037. [2025-02-05 10:38:45,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 967 states have (on average 1.2916235780765253) internal successors, (1249), 963 states have internal predecessors, (1249), 63 states have call successors, (63), 2 states have call predecessors, (63), 6 states have return successors, (92), 76 states have call predecessors, (92), 62 states have call successors, (92) [2025-02-05 10:38:45,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1404 transitions. [2025-02-05 10:38:45,702 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1404 transitions. Word has length 50 [2025-02-05 10:38:45,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:45,702 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1404 transitions. [2025-02-05 10:38:45,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:45,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1404 transitions. [2025-02-05 10:38:45,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 10:38:45,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:45,704 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:45,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 10:38:45,704 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:45,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:45,704 INFO L85 PathProgramCache]: Analyzing trace with hash 264243917, now seen corresponding path program 1 times [2025-02-05 10:38:45,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:45,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627167623] [2025-02-05 10:38:45,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:45,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:45,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 10:38:45,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 10:38:45,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:45,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:45,781 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:38:45,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:45,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627167623] [2025-02-05 10:38:45,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627167623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:45,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:45,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 10:38:45,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026474011] [2025-02-05 10:38:45,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:45,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 10:38:45,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:45,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 10:38:45,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:38:45,782 INFO L87 Difference]: Start difference. First operand 1037 states and 1404 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:45,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:45,931 INFO L93 Difference]: Finished difference Result 1261 states and 1694 transitions. [2025-02-05 10:38:45,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 10:38:45,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2025-02-05 10:38:45,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:45,937 INFO L225 Difference]: With dead ends: 1261 [2025-02-05 10:38:45,937 INFO L226 Difference]: Without dead ends: 1226 [2025-02-05 10:38:45,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:38:45,938 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 47 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:45,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 533 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:45,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2025-02-05 10:38:45,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1167. [2025-02-05 10:38:45,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 1089 states have (on average 1.295684113865932) internal successors, (1411), 1086 states have internal predecessors, (1411), 71 states have call successors, (71), 2 states have call predecessors, (71), 6 states have return successors, (100), 84 states have call predecessors, (100), 70 states have call successors, (100) [2025-02-05 10:38:45,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1582 transitions. [2025-02-05 10:38:45,981 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1582 transitions. Word has length 50 [2025-02-05 10:38:45,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:45,981 INFO L471 AbstractCegarLoop]: Abstraction has 1167 states and 1582 transitions. [2025-02-05 10:38:45,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:45,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1582 transitions. [2025-02-05 10:38:45,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 10:38:45,984 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:45,984 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:45,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 10:38:45,984 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:45,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:45,984 INFO L85 PathProgramCache]: Analyzing trace with hash -2029399583, now seen corresponding path program 1 times [2025-02-05 10:38:45,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:45,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209039502] [2025-02-05 10:38:45,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:45,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:45,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 10:38:46,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 10:38:46,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:46,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:46,356 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 10:38:46,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:46,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209039502] [2025-02-05 10:38:46,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209039502] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:46,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:46,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 10:38:46,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455022223] [2025-02-05 10:38:46,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:46,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 10:38:46,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:46,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 10:38:46,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-05 10:38:46,357 INFO L87 Difference]: Start difference. First operand 1167 states and 1582 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:46,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:46,634 INFO L93 Difference]: Finished difference Result 1213 states and 1640 transitions. [2025-02-05 10:38:46,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 10:38:46,635 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2025-02-05 10:38:46,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:46,641 INFO L225 Difference]: With dead ends: 1213 [2025-02-05 10:38:46,641 INFO L226 Difference]: Without dead ends: 1211 [2025-02-05 10:38:46,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-02-05 10:38:46,645 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 87 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:46,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1208 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:38:46,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2025-02-05 10:38:46,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1171. [2025-02-05 10:38:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 1092 states have (on average 1.294871794871795) internal successors, (1414), 1089 states have internal predecessors, (1414), 71 states have call successors, (71), 3 states have call predecessors, (71), 7 states have return successors, (100), 84 states have call predecessors, (100), 70 states have call successors, (100) [2025-02-05 10:38:46,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1585 transitions. [2025-02-05 10:38:46,685 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1585 transitions. Word has length 50 [2025-02-05 10:38:46,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:46,685 INFO L471 AbstractCegarLoop]: Abstraction has 1171 states and 1585 transitions. [2025-02-05 10:38:46,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:46,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1585 transitions. [2025-02-05 10:38:46,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 10:38:46,687 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:46,687 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:46,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 10:38:46,687 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:46,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:46,687 INFO L85 PathProgramCache]: Analyzing trace with hash -746745257, now seen corresponding path program 1 times [2025-02-05 10:38:46,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:46,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033476418] [2025-02-05 10:38:46,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:46,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:46,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-05 10:38:46,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 10:38:46,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:46,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:46,746 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:38:46,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:46,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033476418] [2025-02-05 10:38:46,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033476418] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:46,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:46,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:38:46,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181355337] [2025-02-05 10:38:46,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:46,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:38:46,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:46,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:38:46,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:38:46,748 INFO L87 Difference]: Start difference. First operand 1171 states and 1585 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:46,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:46,791 INFO L93 Difference]: Finished difference Result 1180 states and 1593 transitions. [2025-02-05 10:38:46,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:38:46,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2025-02-05 10:38:46,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:46,798 INFO L225 Difference]: With dead ends: 1180 [2025-02-05 10:38:46,798 INFO L226 Difference]: Without dead ends: 1128 [2025-02-05 10:38:46,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:38:46,799 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:46,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 360 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:46,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2025-02-05 10:38:46,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1060. [2025-02-05 10:38:46,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 988 states have (on average 1.3097165991902835) internal successors, (1294), 987 states have internal predecessors, (1294), 64 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (88), 74 states have call predecessors, (88), 62 states have call successors, (88) [2025-02-05 10:38:46,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1446 transitions. [2025-02-05 10:38:46,848 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1446 transitions. Word has length 52 [2025-02-05 10:38:46,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:46,848 INFO L471 AbstractCegarLoop]: Abstraction has 1060 states and 1446 transitions. [2025-02-05 10:38:46,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:46,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1446 transitions. [2025-02-05 10:38:46,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 10:38:46,850 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:46,850 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:46,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 10:38:46,851 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:46,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:46,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1509721509, now seen corresponding path program 1 times [2025-02-05 10:38:46,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:46,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618362175] [2025-02-05 10:38:46,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:46,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:46,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-05 10:38:46,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 10:38:46,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:46,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:47,016 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:38:47,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:47,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618362175] [2025-02-05 10:38:47,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618362175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:47,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:47,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 10:38:47,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041123537] [2025-02-05 10:38:47,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:47,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 10:38:47,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:47,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 10:38:47,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:38:47,018 INFO L87 Difference]: Start difference. First operand 1060 states and 1446 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:47,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:47,282 INFO L93 Difference]: Finished difference Result 1441 states and 1981 transitions. [2025-02-05 10:38:47,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 10:38:47,282 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2025-02-05 10:38:47,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:47,288 INFO L225 Difference]: With dead ends: 1441 [2025-02-05 10:38:47,288 INFO L226 Difference]: Without dead ends: 1371 [2025-02-05 10:38:47,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:38:47,289 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 53 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:47,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 578 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:38:47,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2025-02-05 10:38:47,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1080. [2025-02-05 10:38:47,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1002 states have (on average 1.318363273453094) internal successors, (1321), 1003 states have internal predecessors, (1321), 70 states have call successors, (70), 3 states have call predecessors, (70), 7 states have return successors, (89), 77 states have call predecessors, (89), 67 states have call successors, (89) [2025-02-05 10:38:47,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1480 transitions. [2025-02-05 10:38:47,333 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1480 transitions. Word has length 52 [2025-02-05 10:38:47,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:47,333 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 1480 transitions. [2025-02-05 10:38:47,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:47,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1480 transitions. [2025-02-05 10:38:47,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 10:38:47,335 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:47,335 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:47,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 10:38:47,336 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:47,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:47,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1235786567, now seen corresponding path program 1 times [2025-02-05 10:38:47,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:47,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511961700] [2025-02-05 10:38:47,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:47,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:47,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 10:38:47,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 10:38:47,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:47,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:47,366 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:38:47,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:47,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511961700] [2025-02-05 10:38:47,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511961700] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:47,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:47,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:47,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889382619] [2025-02-05 10:38:47,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:47,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:47,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:47,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:47,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:47,367 INFO L87 Difference]: Start difference. First operand 1080 states and 1480 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:47,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:47,421 INFO L93 Difference]: Finished difference Result 1318 states and 1797 transitions. [2025-02-05 10:38:47,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:47,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2025-02-05 10:38:47,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:47,427 INFO L225 Difference]: With dead ends: 1318 [2025-02-05 10:38:47,428 INFO L226 Difference]: Without dead ends: 1152 [2025-02-05 10:38:47,429 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-05 10:38:47,429 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 50 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:47,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 289 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:47,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2025-02-05 10:38:47,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1034. [2025-02-05 10:38:47,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 959 states have (on average 1.3190823774765381) internal successors, (1265), 961 states have internal predecessors, (1265), 67 states have call successors, (67), 3 states have call predecessors, (67), 7 states have return successors, (82), 73 states have call predecessors, (82), 64 states have call successors, (82) [2025-02-05 10:38:47,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1414 transitions. [2025-02-05 10:38:47,486 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1414 transitions. Word has length 53 [2025-02-05 10:38:47,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:47,486 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1414 transitions. [2025-02-05 10:38:47,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:47,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1414 transitions. [2025-02-05 10:38:47,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 10:38:47,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:47,489 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:47,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 10:38:47,489 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:47,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:47,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1458768879, now seen corresponding path program 1 times [2025-02-05 10:38:47,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:47,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723604172] [2025-02-05 10:38:47,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:47,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:47,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 10:38:47,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 10:38:47,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:47,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:47,911 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 10:38:47,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:47,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723604172] [2025-02-05 10:38:47,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723604172] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:47,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939390923] [2025-02-05 10:38:47,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:47,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:47,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:47,914 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:47,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 10:38:47,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 10:38:47,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 10:38:47,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:47,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:47,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-05 10:38:47,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:48,193 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:38:48,193 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:48,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939390923] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:48,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:38:48,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 22 [2025-02-05 10:38:48,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053998609] [2025-02-05 10:38:48,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:48,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 10:38:48,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:48,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 10:38:48,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2025-02-05 10:38:48,194 INFO L87 Difference]: Start difference. First operand 1034 states and 1414 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:48,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:48,602 INFO L93 Difference]: Finished difference Result 1329 states and 1797 transitions. [2025-02-05 10:38:48,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 10:38:48,602 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2025-02-05 10:38:48,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:48,607 INFO L225 Difference]: With dead ends: 1329 [2025-02-05 10:38:48,607 INFO L226 Difference]: Without dead ends: 1239 [2025-02-05 10:38:48,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2025-02-05 10:38:48,609 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 151 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:48,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1477 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:38:48,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2025-02-05 10:38:48,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1096. [2025-02-05 10:38:48,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 1015 states have (on average 1.296551724137931) internal successors, (1316), 1018 states have internal predecessors, (1316), 73 states have call successors, (73), 3 states have call predecessors, (73), 7 states have return successors, (88), 79 states have call predecessors, (88), 70 states have call successors, (88) [2025-02-05 10:38:48,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1477 transitions. [2025-02-05 10:38:48,645 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1477 transitions. Word has length 55 [2025-02-05 10:38:48,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:48,646 INFO L471 AbstractCegarLoop]: Abstraction has 1096 states and 1477 transitions. [2025-02-05 10:38:48,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:48,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1477 transitions. [2025-02-05 10:38:48,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 10:38:48,648 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:48,648 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:48,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-05 10:38:48,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-05 10:38:48,854 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:48,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:48,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1317775355, now seen corresponding path program 2 times [2025-02-05 10:38:48,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:48,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730564874] [2025-02-05 10:38:48,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:38:48,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:48,862 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-02-05 10:38:48,876 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 55 statements. [2025-02-05 10:38:48,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 10:38:48,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:48,958 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:38:48,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:48,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730564874] [2025-02-05 10:38:48,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730564874] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:48,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:48,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 10:38:48,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582974785] [2025-02-05 10:38:48,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:48,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 10:38:48,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:48,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 10:38:48,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:38:48,961 INFO L87 Difference]: Start difference. First operand 1096 states and 1477 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:49,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:49,127 INFO L93 Difference]: Finished difference Result 1328 states and 1787 transitions. [2025-02-05 10:38:49,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:38:49,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2025-02-05 10:38:49,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:49,132 INFO L225 Difference]: With dead ends: 1328 [2025-02-05 10:38:49,133 INFO L226 Difference]: Without dead ends: 1245 [2025-02-05 10:38:49,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:38:49,134 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 134 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:49,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 496 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:49,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2025-02-05 10:38:49,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 1096. [2025-02-05 10:38:49,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 1015 states have (on average 1.2916256157635468) internal successors, (1311), 1018 states have internal predecessors, (1311), 73 states have call successors, (73), 3 states have call predecessors, (73), 7 states have return successors, (88), 79 states have call predecessors, (88), 70 states have call successors, (88) [2025-02-05 10:38:49,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1472 transitions. [2025-02-05 10:38:49,183 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1472 transitions. Word has length 55 [2025-02-05 10:38:49,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:49,186 INFO L471 AbstractCegarLoop]: Abstraction has 1096 states and 1472 transitions. [2025-02-05 10:38:49,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:49,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1472 transitions. [2025-02-05 10:38:49,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 10:38:49,188 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:49,188 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:49,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 10:38:49,189 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:49,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:49,189 INFO L85 PathProgramCache]: Analyzing trace with hash -479176004, now seen corresponding path program 1 times [2025-02-05 10:38:49,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:49,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306841556] [2025-02-05 10:38:49,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:49,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:49,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 10:38:49,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 10:38:49,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:49,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:49,394 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:38:49,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:49,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306841556] [2025-02-05 10:38:49,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306841556] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:49,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47171913] [2025-02-05 10:38:49,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:49,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:49,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:49,397 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:49,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 10:38:49,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 10:38:49,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 10:38:49,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:49,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:49,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 10:38:49,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:49,550 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:38:49,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:38:49,653 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:38:49,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47171913] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:49,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:38:49,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 10] total 19 [2025-02-05 10:38:49,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446514014] [2025-02-05 10:38:49,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:49,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 10:38:49,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:49,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 10:38:49,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-02-05 10:38:49,655 INFO L87 Difference]: Start difference. First operand 1096 states and 1472 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:49,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:49,842 INFO L93 Difference]: Finished difference Result 1168 states and 1558 transitions. [2025-02-05 10:38:49,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 10:38:49,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2025-02-05 10:38:49,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:49,847 INFO L225 Difference]: With dead ends: 1168 [2025-02-05 10:38:49,847 INFO L226 Difference]: Without dead ends: 1110 [2025-02-05 10:38:49,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-02-05 10:38:49,848 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 51 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:49,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 450 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:49,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2025-02-05 10:38:49,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 983. [2025-02-05 10:38:49,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 911 states have (on average 1.2766190998902305) internal successors, (1163), 912 states have internal predecessors, (1163), 64 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (79), 70 states have call predecessors, (79), 61 states have call successors, (79) [2025-02-05 10:38:49,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1306 transitions. [2025-02-05 10:38:49,887 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1306 transitions. Word has length 55 [2025-02-05 10:38:49,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:49,887 INFO L471 AbstractCegarLoop]: Abstraction has 983 states and 1306 transitions. [2025-02-05 10:38:49,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:49,887 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1306 transitions. [2025-02-05 10:38:49,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 10:38:49,889 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:49,889 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:49,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-05 10:38:50,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-05 10:38:50,093 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:50,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:50,093 INFO L85 PathProgramCache]: Analyzing trace with hash -209740450, now seen corresponding path program 1 times [2025-02-05 10:38:50,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:50,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940463380] [2025-02-05 10:38:50,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:50,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:50,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 10:38:50,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:38:50,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:50,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:50,166 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:38:50,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:50,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940463380] [2025-02-05 10:38:50,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940463380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:50,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:50,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 10:38:50,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336137991] [2025-02-05 10:38:50,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:50,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 10:38:50,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:50,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 10:38:50,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:38:50,168 INFO L87 Difference]: Start difference. First operand 983 states and 1306 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:50,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:50,234 INFO L93 Difference]: Finished difference Result 995 states and 1318 transitions. [2025-02-05 10:38:50,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 10:38:50,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 57 [2025-02-05 10:38:50,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:50,238 INFO L225 Difference]: With dead ends: 995 [2025-02-05 10:38:50,238 INFO L226 Difference]: Without dead ends: 993 [2025-02-05 10:38:50,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:38:50,252 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 8 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:50,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 591 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:50,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2025-02-05 10:38:50,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 989. [2025-02-05 10:38:50,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 915 states have (on average 1.2754098360655737) internal successors, (1167), 917 states have internal predecessors, (1167), 65 states have call successors, (65), 4 states have call predecessors, (65), 8 states have return successors, (80), 70 states have call predecessors, (80), 62 states have call successors, (80) [2025-02-05 10:38:50,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1312 transitions. [2025-02-05 10:38:50,285 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1312 transitions. Word has length 57 [2025-02-05 10:38:50,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:50,285 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1312 transitions. [2025-02-05 10:38:50,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:50,285 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1312 transitions. [2025-02-05 10:38:50,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 10:38:50,287 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:50,287 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:50,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 10:38:50,288 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:50,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:50,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1338234001, now seen corresponding path program 1 times [2025-02-05 10:38:50,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:50,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689129149] [2025-02-05 10:38:50,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:50,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:50,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 10:38:50,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 10:38:50,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:50,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:50,442 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:38:50,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:50,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689129149] [2025-02-05 10:38:50,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689129149] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:50,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:50,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 10:38:50,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265445837] [2025-02-05 10:38:50,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:50,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 10:38:50,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:50,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 10:38:50,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:38:50,444 INFO L87 Difference]: Start difference. First operand 989 states and 1312 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:50,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:50,695 INFO L93 Difference]: Finished difference Result 1319 states and 1735 transitions. [2025-02-05 10:38:50,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 10:38:50,695 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 58 [2025-02-05 10:38:50,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:50,701 INFO L225 Difference]: With dead ends: 1319 [2025-02-05 10:38:50,702 INFO L226 Difference]: Without dead ends: 1261 [2025-02-05 10:38:50,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 10:38:50,704 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 128 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:50,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 689 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:38:50,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2025-02-05 10:38:50,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 989. [2025-02-05 10:38:50,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 915 states have (on average 1.2710382513661203) internal successors, (1163), 917 states have internal predecessors, (1163), 65 states have call successors, (65), 4 states have call predecessors, (65), 8 states have return successors, (80), 70 states have call predecessors, (80), 62 states have call successors, (80) [2025-02-05 10:38:50,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1308 transitions. [2025-02-05 10:38:50,749 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1308 transitions. Word has length 58 [2025-02-05 10:38:50,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:50,749 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1308 transitions. [2025-02-05 10:38:50,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:50,750 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1308 transitions. [2025-02-05 10:38:50,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 10:38:50,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:50,753 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:50,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 10:38:50,753 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:50,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:50,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1549584914, now seen corresponding path program 1 times [2025-02-05 10:38:50,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:50,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738195867] [2025-02-05 10:38:50,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:50,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:50,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 10:38:50,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 10:38:50,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:50,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:50,892 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:50,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:50,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738195867] [2025-02-05 10:38:50,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738195867] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:50,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741399843] [2025-02-05 10:38:50,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:50,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:50,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:50,895 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:50,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-05 10:38:50,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 10:38:50,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 10:38:50,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:50,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:50,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 10:38:50,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:51,081 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:51,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:38:51,303 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:51,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741399843] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:38:51,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:38:51,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 13 [2025-02-05 10:38:51,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563237908] [2025-02-05 10:38:51,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:38:51,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 10:38:51,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:51,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 10:38:51,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-05 10:38:51,305 INFO L87 Difference]: Start difference. First operand 989 states and 1308 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 11 states have internal predecessors, (58), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 10:38:51,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:51,474 INFO L93 Difference]: Finished difference Result 1214 states and 1595 transitions. [2025-02-05 10:38:51,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 10:38:51,475 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 11 states have internal predecessors, (58), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 58 [2025-02-05 10:38:51,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:51,482 INFO L225 Difference]: With dead ends: 1214 [2025-02-05 10:38:51,483 INFO L226 Difference]: Without dead ends: 989 [2025-02-05 10:38:51,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 108 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-02-05 10:38:51,484 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 7 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:51,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 948 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:51,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2025-02-05 10:38:51,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 989. [2025-02-05 10:38:51,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 916 states have (on average 1.2707423580786026) internal successors, (1164), 919 states have internal predecessors, (1164), 64 states have call successors, (64), 4 states have call predecessors, (64), 8 states have return successors, (77), 68 states have call predecessors, (77), 61 states have call successors, (77) [2025-02-05 10:38:51,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1305 transitions. [2025-02-05 10:38:51,520 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1305 transitions. Word has length 58 [2025-02-05 10:38:51,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:51,520 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1305 transitions. [2025-02-05 10:38:51,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 11 states have internal predecessors, (58), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-05 10:38:51,520 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1305 transitions. [2025-02-05 10:38:51,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 10:38:51,522 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:51,522 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:51,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-05 10:38:51,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:51,723 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:51,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:51,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1542523258, now seen corresponding path program 1 times [2025-02-05 10:38:51,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:51,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750103410] [2025-02-05 10:38:51,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:51,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:51,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 10:38:51,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 10:38:51,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:51,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:51,798 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 10:38:51,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:51,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750103410] [2025-02-05 10:38:51,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750103410] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:51,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:51,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 10:38:51,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958949287] [2025-02-05 10:38:51,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:51,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 10:38:51,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:51,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 10:38:51,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:38:51,801 INFO L87 Difference]: Start difference. First operand 989 states and 1305 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 10:38:51,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:51,909 INFO L93 Difference]: Finished difference Result 1072 states and 1426 transitions. [2025-02-05 10:38:51,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:38:51,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 62 [2025-02-05 10:38:51,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:51,912 INFO L225 Difference]: With dead ends: 1072 [2025-02-05 10:38:51,913 INFO L226 Difference]: Without dead ends: 1067 [2025-02-05 10:38:51,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:38:51,913 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 10 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:51,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 446 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:51,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2025-02-05 10:38:51,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1038. [2025-02-05 10:38:51,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 949 states have (on average 1.2845100105374079) internal successors, (1219), 967 states have internal predecessors, (1219), 79 states have call successors, (79), 5 states have call predecessors, (79), 9 states have return successors, (92), 68 states have call predecessors, (92), 76 states have call successors, (92) [2025-02-05 10:38:51,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1390 transitions. [2025-02-05 10:38:51,956 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1390 transitions. Word has length 62 [2025-02-05 10:38:51,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:51,956 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1390 transitions. [2025-02-05 10:38:51,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 10:38:51,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1390 transitions. [2025-02-05 10:38:51,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 10:38:51,958 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:51,958 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:51,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 10:38:51,958 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:51,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:51,959 INFO L85 PathProgramCache]: Analyzing trace with hash 705290042, now seen corresponding path program 1 times [2025-02-05 10:38:51,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:51,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055074906] [2025-02-05 10:38:51,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:51,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:51,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 10:38:51,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 10:38:51,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:51,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:52,124 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 10:38:52,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:52,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055074906] [2025-02-05 10:38:52,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055074906] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:52,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86151883] [2025-02-05 10:38:52,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:52,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:52,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:52,128 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:52,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-05 10:38:52,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 10:38:52,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 10:38:52,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:52,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:52,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 10:38:52,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 10:38:52,248 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:52,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86151883] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:52,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:38:52,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2025-02-05 10:38:52,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083017754] [2025-02-05 10:38:52,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:52,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 10:38:52,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:52,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 10:38:52,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-02-05 10:38:52,250 INFO L87 Difference]: Start difference. First operand 1038 states and 1390 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 10:38:52,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:52,363 INFO L93 Difference]: Finished difference Result 1629 states and 2165 transitions. [2025-02-05 10:38:52,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 10:38:52,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 63 [2025-02-05 10:38:52,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:52,368 INFO L225 Difference]: With dead ends: 1629 [2025-02-05 10:38:52,368 INFO L226 Difference]: Without dead ends: 1397 [2025-02-05 10:38:52,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 10:38:52,370 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 20 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:52,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 464 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:52,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2025-02-05 10:38:52,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1054. [2025-02-05 10:38:52,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 965 states have (on average 1.2797927461139897) internal successors, (1235), 983 states have internal predecessors, (1235), 79 states have call successors, (79), 5 states have call predecessors, (79), 9 states have return successors, (92), 68 states have call predecessors, (92), 76 states have call successors, (92) [2025-02-05 10:38:52,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1406 transitions. [2025-02-05 10:38:52,446 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1406 transitions. Word has length 63 [2025-02-05 10:38:52,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:52,446 INFO L471 AbstractCegarLoop]: Abstraction has 1054 states and 1406 transitions. [2025-02-05 10:38:52,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 10:38:52,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1406 transitions. [2025-02-05 10:38:52,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 10:38:52,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:52,451 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:52,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-05 10:38:52,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:52,652 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:52,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:52,652 INFO L85 PathProgramCache]: Analyzing trace with hash 290578518, now seen corresponding path program 1 times [2025-02-05 10:38:52,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:52,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654253985] [2025-02-05 10:38:52,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:52,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:52,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 10:38:52,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 10:38:52,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:52,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:52,764 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 10:38:52,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:52,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654253985] [2025-02-05 10:38:52,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654253985] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:52,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:52,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 10:38:52,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115606207] [2025-02-05 10:38:52,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:52,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 10:38:52,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:52,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 10:38:52,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:38:52,766 INFO L87 Difference]: Start difference. First operand 1054 states and 1406 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 10:38:52,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:52,885 INFO L93 Difference]: Finished difference Result 1121 states and 1495 transitions. [2025-02-05 10:38:52,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 10:38:52,885 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 64 [2025-02-05 10:38:52,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:52,891 INFO L225 Difference]: With dead ends: 1121 [2025-02-05 10:38:52,891 INFO L226 Difference]: Without dead ends: 1116 [2025-02-05 10:38:52,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:38:52,893 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 9 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:52,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 575 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:52,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2025-02-05 10:38:52,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1053. [2025-02-05 10:38:52,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 964 states have (on average 1.2790456431535269) internal successors, (1233), 982 states have internal predecessors, (1233), 79 states have call successors, (79), 5 states have call predecessors, (79), 9 states have return successors, (92), 68 states have call predecessors, (92), 76 states have call successors, (92) [2025-02-05 10:38:52,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1404 transitions. [2025-02-05 10:38:52,937 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1404 transitions. Word has length 64 [2025-02-05 10:38:52,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:52,938 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1404 transitions. [2025-02-05 10:38:52,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-05 10:38:52,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1404 transitions. [2025-02-05 10:38:52,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 10:38:52,939 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:52,940 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:52,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 10:38:52,940 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:52,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:52,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1207963746, now seen corresponding path program 1 times [2025-02-05 10:38:52,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:52,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617706494] [2025-02-05 10:38:52,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:52,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:52,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 10:38:52,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 10:38:52,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:52,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:53,201 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 10:38:53,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:53,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617706494] [2025-02-05 10:38:53,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617706494] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:53,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:53,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 10:38:53,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195714671] [2025-02-05 10:38:53,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:53,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 10:38:53,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:53,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 10:38:53,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 10:38:53,204 INFO L87 Difference]: Start difference. First operand 1053 states and 1404 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 10:38:53,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:53,416 INFO L93 Difference]: Finished difference Result 1406 states and 1861 transitions. [2025-02-05 10:38:53,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 10:38:53,417 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 64 [2025-02-05 10:38:53,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:53,424 INFO L225 Difference]: With dead ends: 1406 [2025-02-05 10:38:53,424 INFO L226 Difference]: Without dead ends: 1114 [2025-02-05 10:38:53,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-02-05 10:38:53,426 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 80 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:53,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 895 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:53,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2025-02-05 10:38:53,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1053. [2025-02-05 10:38:53,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 964 states have (on average 1.2717842323651452) internal successors, (1226), 982 states have internal predecessors, (1226), 79 states have call successors, (79), 5 states have call predecessors, (79), 9 states have return successors, (92), 68 states have call predecessors, (92), 76 states have call successors, (92) [2025-02-05 10:38:53,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1397 transitions. [2025-02-05 10:38:53,468 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1397 transitions. Word has length 64 [2025-02-05 10:38:53,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:53,468 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1397 transitions. [2025-02-05 10:38:53,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 10:38:53,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1397 transitions. [2025-02-05 10:38:53,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 10:38:53,472 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:53,472 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:53,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 10:38:53,472 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:53,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:53,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1994081349, now seen corresponding path program 1 times [2025-02-05 10:38:53,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:53,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506035044] [2025-02-05 10:38:53,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:53,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:53,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 10:38:53,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 10:38:53,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:53,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 10:38:53,507 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 10:38:53,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 10:38:53,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 10:38:53,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:53,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 10:38:53,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 10:38:53,560 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 10:38:53,561 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 10:38:53,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-05 10:38:53,565 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:38:53,613 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 10:38:53,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:38:53 BoogieIcfgContainer [2025-02-05 10:38:53,616 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 10:38:53,617 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 10:38:53,617 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 10:38:53,617 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 10:38:53,617 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:38:35" (3/4) ... [2025-02-05 10:38:53,619 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 10:38:53,620 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 10:38:53,621 INFO L158 Benchmark]: Toolchain (without parser) took 19187.83ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 112.1MB in the beginning and 121.7MB in the end (delta: -9.6MB). Peak memory consumption was 172.0MB. Max. memory is 16.1GB. [2025-02-05 10:38:53,621 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:38:53,621 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.09ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 97.8MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 10:38:53,623 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.13ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 95.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:38:53,623 INFO L158 Benchmark]: Boogie Preprocessor took 48.05ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 94.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:38:53,623 INFO L158 Benchmark]: IcfgBuilder took 581.30ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 69.4MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 10:38:53,623 INFO L158 Benchmark]: TraceAbstraction took 18249.87ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 68.9MB in the beginning and 121.8MB in the end (delta: -52.9MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2025-02-05 10:38:53,623 INFO L158 Benchmark]: Witness Printer took 3.15ms. Allocated memory is still 327.2MB. Free memory was 121.8MB in the beginning and 121.7MB in the end (delta: 54.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:38:53,624 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.57ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.09ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 97.8MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.13ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 95.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.05ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 94.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 581.30ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 69.4MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 18249.87ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 68.9MB in the beginning and 121.8MB in the end (delta: -52.9MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. * Witness Printer took 3.15ms. Allocated memory is still 327.2MB. Free memory was 121.8MB in the beginning and 121.7MB in the end (delta: 54.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 114, overapproximation of bitwiseOr at line 111, overapproximation of bitwiseAnd at line 127. Possible FailurePath: [L227] unsigned int a ; [L228] unsigned int ma = __VERIFIER_nondet_uint(); [L229] signed char ea = __VERIFIER_nondet_char(); [L230] unsigned int b ; [L231] unsigned int mb = __VERIFIER_nondet_uint(); [L232] signed char eb = __VERIFIER_nondet_char(); [L233] unsigned int r_add ; [L234] unsigned int zero ; [L235] int sa ; [L236] int sb ; [L237] int tmp ; [L238] int tmp___0 ; [L239] int tmp___1 ; [L240] int tmp___2 ; [L241] int tmp___3 ; [L242] int tmp___4 ; [L243] int tmp___5 ; [L244] int tmp___6 ; [L245] int tmp___7 ; [L246] int tmp___8 ; [L247] int tmp___9 ; [L248] int __retres23 ; VAL [ea=127, eb=127] [L252] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L30] COND TRUE ! m [L31] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L81] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L252] RET, EXPR base2flt(0, 0) VAL [ea=127, eb=127] [L252] zero = base2flt(0, 0) [L253] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m)=4328521728] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L30] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L58] COND TRUE 1 VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L60] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L65] COND TRUE e >= 127 [L66] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=4328521728, __retres4=4294967295, m=4328521728] [L81] return (__retres4); VAL [\old(e)=127, \old(m)=4328521728, \result=4294967295, m=4328521728] [L253] RET, EXPR base2flt(ma, ea) VAL [ea=127, eb=127, ma=4328521728, zero=0] [L253] a = base2flt(ma, ea) [L254] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=127, \old(m)=33554432] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L30] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L58] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L60] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L65] COND TRUE e >= 127 [L66] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, m=33554432] [L81] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, m=33554432] [L254] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, zero=0] [L254] b = base2flt(mb, eb) [L256] COND FALSE !(a < zero) VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, zero=0] [L259] COND TRUE a > zero [L260] tmp = 1 VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, tmp=1, zero=0] [L264] sa = tmp VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, sa=1, zero=0] [L266] COND FALSE !(b < zero) VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, sa=1, zero=0] [L269] COND TRUE b > zero [L270] tmp___0 = 1 VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, sa=1, tmp___0=1] [L274] sb = tmp___0 VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, sa=1, sb=1] [L277] CALL addflt(a, b) [L85] unsigned int res ; [L86] unsigned int ma ; [L87] unsigned int mb ; [L88] unsigned int delta ; [L89] int ea ; [L90] int eb ; [L91] unsigned int tmp ; [L92] unsigned int __retres10 ; VAL [a=4294967295, b=4294967295] [L95] COND FALSE !(a < b) VAL [a=4294967295, b=4294967295] [L102] COND FALSE !(! b) [L109] ma = a & ((1U << 24U) - 1U) [L110] ea = (int )(a >> 24U) - 128 VAL [a=4294967295, b=4294967295, ea=127, ma=16777215] [L111] EXPR ma | (1U << 24U) VAL [a=4294967295, b=4294967295, ea=127] [L111] ma = ma | (1U << 24U) [L112] mb = b & ((1U << 24U) - 1U) [L113] eb = (int )(b >> 24U) - 128 VAL [a=4294967295, ea=127, eb=127, ma=-4278190079, mb=16777215] [L114] EXPR mb | (1U << 24U) VAL [a=4294967295, ea=127, eb=127, ma=-4278190079] [L114] mb = mb | (1U << 24U) [L115] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L17] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L115] RET __VERIFIER_assert(ea >= eb) VAL [a=4294967295, ea=127, eb=127, ma=-4278190079, mb=-4278190080] [L116] delta = ea - eb VAL [a=4294967295, delta=0, ea=127, ma=-4278190079, mb=-4278190080] [L117] COND FALSE !(!(delta < sizeof(mb) * 8)) VAL [a=4294967295, delta=0, ea=127, ma=-4278190079, mb=-4278190080] [L118] EXPR mb >> delta VAL [a=4294967295, ea=127, ma=-4278190079] [L118] mb = mb >> delta [L120] COND FALSE !(! mb) [L126] ma = ma + mb VAL [a=4294967295, ea=127, ma=-8556380159] [L127] ma & (1U << 25U) VAL [a=4294967295, ea=127, ma=-8556380159] [L127] COND FALSE !(ma & (1U << 25U)) [L140] CALL __VERIFIER_assert(ma < 1U << 25U) VAL [\old(cond)=0] [L17] COND TRUE !(cond) VAL [\old(cond)=0] [L18] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.1s, OverallIterations: 36, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1718 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1635 mSDsluCounter, 23101 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18401 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5255 IncrementalHoareTripleChecker+Invalid, 5371 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 4700 mSDtfsCounter, 5255 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1294 GetRequests, 1013 SyntacticMatches, 7 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1171occurred in iteration=22, InterpolantAutomatonStates: 239, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 2552 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 2462 NumberOfCodeBlocks, 2444 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 2722 ConstructedInterpolants, 0 QuantifiedInterpolants, 5655 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1930 ConjunctsInSsa, 193 ConjunctsInUnsatCore, 56 InterpolantComputations, 30 PerfectInterpolantSequences, 784/932 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 10:38:53,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/bitvector/soft_float_1-2a.c.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:38:56,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:38:56,139 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 10:38:56,151 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:38:56,152 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:38:56,181 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:38:56,182 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:38:56,182 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:38:56,183 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:38:56,183 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:38:56,184 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:38:56,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:38:56,184 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:38:56,185 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:38:56,185 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:38:56,185 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:38:56,185 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:38:56,186 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:38:56,186 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:38:56,186 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:38:56,186 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:38:56,186 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:38:56,186 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:38:56,187 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 10:38:56,187 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 10:38:56,187 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 10:38:56,187 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:38:56,187 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:38:56,187 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:38:56,187 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:38:56,187 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:38:56,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:38:56,188 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:38:56,188 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:38:56,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:38:56,188 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:38:56,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:38:56,188 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:38:56,188 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:38:56,188 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 10:38:56,188 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 10:38:56,188 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:38:56,188 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:38:56,188 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:38:56,188 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:38:56,188 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 -> c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 [2025-02-05 10:38:56,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:38:56,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:38:56,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:38:56,540 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:38:56,541 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:38:56,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2025-02-05 10:38:57,907 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f23ef258/69105a2c778f4146a0af7779b38ad3d8/FLAG60d3ae438 [2025-02-05 10:38:58,121 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:38:58,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2025-02-05 10:38:58,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f23ef258/69105a2c778f4146a0af7779b38ad3d8/FLAG60d3ae438 [2025-02-05 10:38:58,151 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f23ef258/69105a2c778f4146a0af7779b38ad3d8 [2025-02-05 10:38:58,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:38:58,156 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:38:58,158 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:38:58,158 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:38:58,162 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:38:58,163 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:38:58" (1/1) ... [2025-02-05 10:38:58,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fc51346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:58, skipping insertion in model container [2025-02-05 10:38:58,166 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:38:58" (1/1) ... [2025-02-05 10:38:58,191 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:38:58,330 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/bitvector/soft_float_1-2a.c.cil.c[755,768] [2025-02-05 10:38:58,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:38:58,421 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:38:58,430 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/bitvector/soft_float_1-2a.c.cil.c[755,768] [2025-02-05 10:38:58,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:38:58,490 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:38:58,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:58 WrapperNode [2025-02-05 10:38:58,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:38:58,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:38:58,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:38:58,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:38:58,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:58" (1/1) ... [2025-02-05 10:38:58,506 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:58" (1/1) ... [2025-02-05 10:38:58,527 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 149 [2025-02-05 10:38:58,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:38:58,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:38:58,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:38:58,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:38:58,537 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:58" (1/1) ... [2025-02-05 10:38:58,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:58" (1/1) ... [2025-02-05 10:38:58,540 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:58" (1/1) ... [2025-02-05 10:38:58,554 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-05 10:38:58,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:58" (1/1) ... [2025-02-05 10:38:58,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:58" (1/1) ... [2025-02-05 10:38:58,561 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:58" (1/1) ... [2025-02-05 10:38:58,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:58" (1/1) ... [2025-02-05 10:38:58,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:58" (1/1) ... [2025-02-05 10:38:58,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:58" (1/1) ... [2025-02-05 10:38:58,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:38:58,567 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:38:58,567 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:38:58,567 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:38:58,568 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:58" (1/1) ... [2025-02-05 10:38:58,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:38:58,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:58,602 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-05 10:38:58,605 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-05 10:38:58,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:38:58,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 10:38:58,633 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-02-05 10:38:58,634 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-02-05 10:38:58,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:38:58,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:38:58,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-05 10:38:58,634 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-05 10:38:58,712 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:38:58,713 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:38:59,105 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2025-02-05 10:38:59,105 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:38:59,117 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:38:59,117 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:38:59,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:38:59 BoogieIcfgContainer [2025-02-05 10:38:59,118 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:38:59,120 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:38:59,121 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:38:59,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:38:59,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:38:58" (1/3) ... [2025-02-05 10:38:59,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a599dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:38:59, skipping insertion in model container [2025-02-05 10:38:59,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:58" (2/3) ... [2025-02-05 10:38:59,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a599dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:38:59, skipping insertion in model container [2025-02-05 10:38:59,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:38:59" (3/3) ... [2025-02-05 10:38:59,128 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2025-02-05 10:38:59,146 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:38:59,148 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_1-2a.c.cil.c that has 3 procedures, 73 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 10:38:59,210 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:38:59,221 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;@5e80539e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:38:59,221 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:38:59,226 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 64 states have internal predecessors, (94), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 10:38:59,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-05 10:38:59,234 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:59,234 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:59,235 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:59,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:59,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1104927982, now seen corresponding path program 1 times [2025-02-05 10:38:59,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:38:59,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [862343044] [2025-02-05 10:38:59,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:59,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:59,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:59,251 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-05 10:38:59,252 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-05 10:38:59,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-05 10:38:59,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-05 10:38:59,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:59,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:59,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 10:38:59,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:59,516 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:59,517 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:59,518 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:38:59,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862343044] [2025-02-05 10:38:59,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862343044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:59,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:59,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 10:38:59,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140010075] [2025-02-05 10:38:59,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:59,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 10:38:59,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:38:59,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 10:38:59,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:38:59,563 INFO L87 Difference]: Start difference. First operand has 73 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 64 states have internal predecessors, (94), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:59,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:59,781 INFO L93 Difference]: Finished difference Result 179 states and 287 transitions. [2025-02-05 10:38:59,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 10:38:59,787 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2025-02-05 10:38:59,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:59,798 INFO L225 Difference]: With dead ends: 179 [2025-02-05 10:38:59,798 INFO L226 Difference]: Without dead ends: 102 [2025-02-05 10:38:59,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:38:59,806 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 38 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:59,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 539 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:38:59,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-05 10:38:59,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2025-02-05 10:38:59,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.4651162790697674) internal successors, (126), 89 states have internal predecessors, (126), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2025-02-05 10:38:59,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 148 transitions. [2025-02-05 10:38:59,856 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 148 transitions. Word has length 32 [2025-02-05 10:38:59,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:59,857 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 148 transitions. [2025-02-05 10:38:59,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:59,857 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 148 transitions. [2025-02-05 10:38:59,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 10:38:59,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:59,862 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 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-05 10:38:59,872 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-05 10:39:00,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:00,063 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:00,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:00,065 INFO L85 PathProgramCache]: Analyzing trace with hash -429025672, now seen corresponding path program 1 times [2025-02-05 10:39:00,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:39:00,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1766529502] [2025-02-05 10:39:00,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:00,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:00,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:00,068 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-05 10:39:00,068 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-05 10:39:00,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 10:39:00,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 10:39:00,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:00,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:00,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 10:39:00,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:00,275 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:39:00,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:39:00,385 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:39:00,386 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:39:00,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766529502] [2025-02-05 10:39:00,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766529502] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 10:39:00,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:39:00,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2025-02-05 10:39:00,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512697002] [2025-02-05 10:39:00,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:00,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 10:39:00,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:39:00,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 10:39:00,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-05 10:39:00,390 INFO L87 Difference]: Start difference. First operand 100 states and 148 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:00,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:00,515 INFO L93 Difference]: Finished difference Result 149 states and 223 transitions. [2025-02-05 10:39:00,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 10:39:00,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2025-02-05 10:39:00,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:00,517 INFO L225 Difference]: With dead ends: 149 [2025-02-05 10:39:00,517 INFO L226 Difference]: Without dead ends: 108 [2025-02-05 10:39:00,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-05 10:39:00,518 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 4 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:00,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 478 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:39:00,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-05 10:39:00,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-02-05 10:39:00,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 93 states have (on average 1.4516129032258065) internal successors, (135), 96 states have internal predecessors, (135), 10 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (15), 11 states have call predecessors, (15), 9 states have call successors, (15) [2025-02-05 10:39:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2025-02-05 10:39:00,540 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 36 [2025-02-05 10:39:00,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:00,540 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2025-02-05 10:39:00,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:00,541 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2025-02-05 10:39:00,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 10:39:00,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:00,542 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 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-05 10:39:00,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 10:39:00,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:00,743 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:00,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:00,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1172069757, now seen corresponding path program 1 times [2025-02-05 10:39:00,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:39:00,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [172448038] [2025-02-05 10:39:00,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:00,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:00,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:00,746 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-05 10:39:00,746 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-05 10:39:00,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 10:39:00,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 10:39:00,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:00,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:00,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:39:00,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:00,819 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:39:00,820 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:39:00,820 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:39:00,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172448038] [2025-02-05 10:39:00,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172448038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:00,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:00,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:39:00,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534936577] [2025-02-05 10:39:00,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:00,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:39:00,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:39:00,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:39:00,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:39:00,822 INFO L87 Difference]: Start difference. First operand 108 states and 160 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:00,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:00,853 INFO L93 Difference]: Finished difference Result 180 states and 269 transitions. [2025-02-05 10:39:00,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:39:00,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2025-02-05 10:39:00,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:00,856 INFO L225 Difference]: With dead ends: 180 [2025-02-05 10:39:00,856 INFO L226 Difference]: Without dead ends: 138 [2025-02-05 10:39:00,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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-05 10:39:00,857 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 17 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:00,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 203 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:00,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-05 10:39:00,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-02-05 10:39:00,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 121 states have (on average 1.4132231404958677) internal successors, (171), 124 states have internal predecessors, (171), 12 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (17), 13 states have call predecessors, (17), 11 states have call successors, (17) [2025-02-05 10:39:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 200 transitions. [2025-02-05 10:39:00,875 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 200 transitions. Word has length 37 [2025-02-05 10:39:00,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:00,875 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 200 transitions. [2025-02-05 10:39:00,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:00,876 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 200 transitions. [2025-02-05 10:39:00,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 10:39:00,877 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:00,877 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 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-05 10:39:00,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 10:39:01,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:01,078 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:01,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:01,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1887166229, now seen corresponding path program 1 times [2025-02-05 10:39:01,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:39:01,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [642736224] [2025-02-05 10:39:01,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:01,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:01,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:01,082 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-05 10:39:01,083 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-05 10:39:01,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 10:39:01,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 10:39:01,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:01,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:01,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 10:39:01,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:01,189 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:39:01,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:39:01,230 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:39:01,230 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:39:01,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642736224] [2025-02-05 10:39:01,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642736224] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:39:01,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:39:01,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2025-02-05 10:39:01,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048944314] [2025-02-05 10:39:01,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 10:39:01,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 10:39:01,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:39:01,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 10:39:01,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:39:01,233 INFO L87 Difference]: Start difference. First operand 138 states and 200 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:39:01,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:01,298 INFO L93 Difference]: Finished difference Result 252 states and 371 transitions. [2025-02-05 10:39:01,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 10:39:01,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2025-02-05 10:39:01,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:01,302 INFO L225 Difference]: With dead ends: 252 [2025-02-05 10:39:01,302 INFO L226 Difference]: Without dead ends: 159 [2025-02-05 10:39:01,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:39:01,305 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 5 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:01,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 500 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:01,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-05 10:39:01,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 149. [2025-02-05 10:39:01,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 130 states have (on average 1.3923076923076922) internal successors, (181), 131 states have internal predecessors, (181), 14 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (23), 17 states have call predecessors, (23), 13 states have call successors, (23) [2025-02-05 10:39:01,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 218 transitions. [2025-02-05 10:39:01,317 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 218 transitions. Word has length 37 [2025-02-05 10:39:01,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:01,317 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 218 transitions. [2025-02-05 10:39:01,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:39:01,317 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 218 transitions. [2025-02-05 10:39:01,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-05 10:39:01,319 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:01,319 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 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-05 10:39:01,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 10:39:01,519 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 [2025-02-05 10:39:01,519 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:01,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:01,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1270475640, now seen corresponding path program 1 times [2025-02-05 10:39:01,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:39:01,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1545652920] [2025-02-05 10:39:01,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:01,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:01,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:01,522 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-05 10:39:01,524 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-05 10:39:01,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-05 10:39:01,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 10:39:01,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:01,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:01,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 10:39:01,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:01,746 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:39:01,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:39:01,958 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:39:01,958 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:39:01,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545652920] [2025-02-05 10:39:01,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545652920] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:39:01,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:39:01,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2025-02-05 10:39:01,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527533092] [2025-02-05 10:39:01,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 10:39:01,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 10:39:01,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:39:01,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 10:39:01,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-02-05 10:39:01,963 INFO L87 Difference]: Start difference. First operand 149 states and 218 transitions. Second operand has 18 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 10:39:02,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:02,450 INFO L93 Difference]: Finished difference Result 464 states and 694 transitions. [2025-02-05 10:39:02,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 10:39:02,450 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 40 [2025-02-05 10:39:02,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:02,453 INFO L225 Difference]: With dead ends: 464 [2025-02-05 10:39:02,455 INFO L226 Difference]: Without dead ends: 375 [2025-02-05 10:39:02,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2025-02-05 10:39:02,458 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 144 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:02,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1331 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:39:02,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-02-05 10:39:02,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 290. [2025-02-05 10:39:02,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 258 states have (on average 1.3527131782945736) internal successors, (349), 255 states have internal predecessors, (349), 27 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (40), 36 states have call predecessors, (40), 26 states have call successors, (40) [2025-02-05 10:39:02,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 416 transitions. [2025-02-05 10:39:02,498 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 416 transitions. Word has length 40 [2025-02-05 10:39:02,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:02,499 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 416 transitions. [2025-02-05 10:39:02,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.75) internal successors, (44), 14 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 10:39:02,500 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 416 transitions. [2025-02-05 10:39:02,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-05 10:39:02,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:02,504 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 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-05 10:39:02,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 10:39:02,704 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 [2025-02-05 10:39:02,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:02,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:02,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1370929208, now seen corresponding path program 1 times [2025-02-05 10:39:02,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:39:02,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [276636064] [2025-02-05 10:39:02,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:02,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:02,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:02,709 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:39:02,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 10:39:02,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-05 10:39:02,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 10:39:02,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:02,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:02,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 10:39:02,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:02,834 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:39:02,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:39:02,899 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:39:02,900 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:39:02,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276636064] [2025-02-05 10:39:02,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276636064] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:39:02,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:39:02,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-02-05 10:39:02,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485563438] [2025-02-05 10:39:02,900 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 10:39:02,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 10:39:02,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:39:02,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 10:39:02,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:39:02,901 INFO L87 Difference]: Start difference. First operand 290 states and 416 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:39:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:03,039 INFO L93 Difference]: Finished difference Result 337 states and 484 transitions. [2025-02-05 10:39:03,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 10:39:03,039 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2025-02-05 10:39:03,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:03,041 INFO L225 Difference]: With dead ends: 337 [2025-02-05 10:39:03,041 INFO L226 Difference]: Without dead ends: 267 [2025-02-05 10:39:03,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-02-05 10:39:03,042 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 28 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:03,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 583 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:39:03,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-02-05 10:39:03,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 263. [2025-02-05 10:39:03,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 237 states have (on average 1.3333333333333333) internal successors, (316), 234 states have internal predecessors, (316), 21 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (34), 30 states have call predecessors, (34), 20 states have call successors, (34) [2025-02-05 10:39:03,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 371 transitions. [2025-02-05 10:39:03,067 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 371 transitions. Word has length 40 [2025-02-05 10:39:03,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:03,068 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 371 transitions. [2025-02-05 10:39:03,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:39:03,069 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 371 transitions. [2025-02-05 10:39:03,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 10:39:03,070 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:03,070 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-05 10:39:03,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 10:39:03,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:03,271 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:03,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:03,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1333726912, now seen corresponding path program 1 times [2025-02-05 10:39:03,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:39:03,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [527134706] [2025-02-05 10:39:03,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:03,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:03,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:03,273 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:39:03,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 10:39:03,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 10:39:03,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 10:39:03,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:03,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:03,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:39:03,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:03,357 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:39:03,358 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:39:03,358 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:39:03,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527134706] [2025-02-05 10:39:03,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527134706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:03,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:03,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:39:03,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98767049] [2025-02-05 10:39:03,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:03,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:39:03,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:39:03,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:39:03,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:39:03,359 INFO L87 Difference]: Start difference. First operand 263 states and 371 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:03,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:03,385 INFO L93 Difference]: Finished difference Result 346 states and 493 transitions. [2025-02-05 10:39:03,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:39:03,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2025-02-05 10:39:03,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:03,387 INFO L225 Difference]: With dead ends: 346 [2025-02-05 10:39:03,387 INFO L226 Difference]: Without dead ends: 273 [2025-02-05 10:39:03,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:39:03,388 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 15 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:03,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 336 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:03,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-02-05 10:39:03,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 266. [2025-02-05 10:39:03,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 243 states have (on average 1.2962962962962963) internal successors, (315), 238 states have internal predecessors, (315), 18 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (31), 27 states have call predecessors, (31), 17 states have call successors, (31) [2025-02-05 10:39:03,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 364 transitions. [2025-02-05 10:39:03,410 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 364 transitions. Word has length 43 [2025-02-05 10:39:03,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:03,410 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 364 transitions. [2025-02-05 10:39:03,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:03,410 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 364 transitions. [2025-02-05 10:39:03,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 10:39:03,411 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:03,412 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:39:03,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 10:39:03,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:03,616 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:03,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:03,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1262940377, now seen corresponding path program 1 times [2025-02-05 10:39:03,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:39:03,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1042243534] [2025-02-05 10:39:03,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:03,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:03,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:03,618 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:39:03,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 10:39:03,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 10:39:03,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 10:39:03,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:03,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:03,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:39:03,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:03,686 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:39:03,686 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:39:03,687 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:39:03,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042243534] [2025-02-05 10:39:03,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042243534] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:03,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:03,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:39:03,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58893053] [2025-02-05 10:39:03,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:03,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:39:03,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:39:03,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:39:03,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:39:03,689 INFO L87 Difference]: Start difference. First operand 266 states and 364 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:03,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:03,711 INFO L93 Difference]: Finished difference Result 277 states and 376 transitions. [2025-02-05 10:39:03,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:39:03,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-02-05 10:39:03,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:03,714 INFO L225 Difference]: With dead ends: 277 [2025-02-05 10:39:03,714 INFO L226 Difference]: Without dead ends: 270 [2025-02-05 10:39:03,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:39:03,714 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:03,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:03,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-02-05 10:39:03,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2025-02-05 10:39:03,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 247 states have (on average 1.291497975708502) internal successors, (319), 242 states have internal predecessors, (319), 18 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (31), 27 states have call predecessors, (31), 17 states have call successors, (31) [2025-02-05 10:39:03,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 368 transitions. [2025-02-05 10:39:03,730 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 368 transitions. Word has length 44 [2025-02-05 10:39:03,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:03,730 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 368 transitions. [2025-02-05 10:39:03,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:03,731 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 368 transitions. [2025-02-05 10:39:03,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 10:39:03,732 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:03,732 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:39:03,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-05 10:39:03,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:03,933 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:03,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:03,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2144523238, now seen corresponding path program 1 times [2025-02-05 10:39:03,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:39:03,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [860359557] [2025-02-05 10:39:03,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:03,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:03,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:03,936 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:39:03,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 10:39:03,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 10:39:03,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 10:39:03,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:03,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:03,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 10:39:03,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:04,005 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:39:04,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:39:04,005 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:39:04,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860359557] [2025-02-05 10:39:04,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860359557] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:04,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:04,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 10:39:04,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481440839] [2025-02-05 10:39:04,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:04,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 10:39:04,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:39:04,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 10:39:04,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:39:04,007 INFO L87 Difference]: Start difference. First operand 270 states and 368 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:04,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:04,044 INFO L93 Difference]: Finished difference Result 277 states and 374 transitions. [2025-02-05 10:39:04,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:39:04,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-02-05 10:39:04,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:04,046 INFO L225 Difference]: With dead ends: 277 [2025-02-05 10:39:04,047 INFO L226 Difference]: Without dead ends: 270 [2025-02-05 10:39:04,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:39:04,049 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 3 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:04,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 383 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:04,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-02-05 10:39:04,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 266. [2025-02-05 10:39:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 243 states have (on average 1.2839506172839505) internal successors, (312), 238 states have internal predecessors, (312), 18 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (31), 27 states have call predecessors, (31), 17 states have call successors, (31) [2025-02-05 10:39:04,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 361 transitions. [2025-02-05 10:39:04,064 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 361 transitions. Word has length 44 [2025-02-05 10:39:04,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:04,064 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 361 transitions. [2025-02-05 10:39:04,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 361 transitions. [2025-02-05 10:39:04,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 10:39:04,065 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:04,065 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 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-05 10:39:04,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-05 10:39:04,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:04,266 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:04,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:04,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1506763822, now seen corresponding path program 2 times [2025-02-05 10:39:04,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:39:04,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [630395105] [2025-02-05 10:39:04,267 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:39:04,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:04,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:04,269 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:39:04,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 10:39:04,304 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-05 10:39:04,313 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 44 statements. [2025-02-05 10:39:04,314 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 10:39:04,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:04,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 10:39:04,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:04,500 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 10:39:04,501 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:39:04,501 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:39:04,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630395105] [2025-02-05 10:39:04,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630395105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:04,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:04,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 10:39:04,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289624277] [2025-02-05 10:39:04,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:04,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 10:39:04,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:39:04,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 10:39:04,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-05 10:39:04,502 INFO L87 Difference]: Start difference. First operand 266 states and 361 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:04,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:04,751 INFO L93 Difference]: Finished difference Result 411 states and 562 transitions. [2025-02-05 10:39:04,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 10:39:04,752 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-02-05 10:39:04,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:04,754 INFO L225 Difference]: With dead ends: 411 [2025-02-05 10:39:04,754 INFO L226 Difference]: Without dead ends: 374 [2025-02-05 10:39:04,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-02-05 10:39:04,755 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 48 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:04,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1088 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:39:04,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-02-05 10:39:04,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 371. [2025-02-05 10:39:04,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 336 states have (on average 1.2886904761904763) internal successors, (433), 334 states have internal predecessors, (433), 29 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (42), 36 states have call predecessors, (42), 28 states have call successors, (42) [2025-02-05 10:39:04,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 504 transitions. [2025-02-05 10:39:04,782 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 504 transitions. Word has length 44 [2025-02-05 10:39:04,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:04,782 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 504 transitions. [2025-02-05 10:39:04,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:04,782 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 504 transitions. [2025-02-05 10:39:04,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 10:39:04,783 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:04,783 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 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-05 10:39:04,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-05 10:39:04,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:04,984 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:04,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:04,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1535392973, now seen corresponding path program 1 times [2025-02-05 10:39:04,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:39:04,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1155042571] [2025-02-05 10:39:04,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:04,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:04,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:04,987 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:39:04,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 10:39:05,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 10:39:05,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 10:39:05,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:05,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:05,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 10:39:05,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:05,087 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 10:39:05,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:39:05,138 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 10:39:05,138 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:39:05,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155042571] [2025-02-05 10:39:05,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155042571] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:39:05,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:39:05,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2025-02-05 10:39:05,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808637239] [2025-02-05 10:39:05,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 10:39:05,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 10:39:05,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:39:05,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 10:39:05,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:39:05,139 INFO L87 Difference]: Start difference. First operand 371 states and 504 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:39:05,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:05,273 INFO L93 Difference]: Finished difference Result 710 states and 993 transitions. [2025-02-05 10:39:05,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 10:39:05,274 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2025-02-05 10:39:05,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:05,277 INFO L225 Difference]: With dead ends: 710 [2025-02-05 10:39:05,277 INFO L226 Difference]: Without dead ends: 546 [2025-02-05 10:39:05,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:39:05,278 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 48 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:05,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 713 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:39:05,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2025-02-05 10:39:05,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 536. [2025-02-05 10:39:05,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 485 states have (on average 1.2948453608247423) internal successors, (628), 481 states have internal predecessors, (628), 45 states have call successors, (45), 3 states have call predecessors, (45), 5 states have return successors, (62), 57 states have call predecessors, (62), 44 states have call successors, (62) [2025-02-05 10:39:05,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 735 transitions. [2025-02-05 10:39:05,313 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 735 transitions. Word has length 44 [2025-02-05 10:39:05,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:05,313 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 735 transitions. [2025-02-05 10:39:05,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:39:05,313 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 735 transitions. [2025-02-05 10:39:05,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 10:39:05,316 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:05,316 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:39:05,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-05 10:39:05,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:05,517 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:05,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:05,518 INFO L85 PathProgramCache]: Analyzing trace with hash -64076270, now seen corresponding path program 1 times [2025-02-05 10:39:05,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:39:05,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1096878324] [2025-02-05 10:39:05,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:05,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:05,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:05,520 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:39:05,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-05 10:39:05,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 10:39:05,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 10:39:05,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:05,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:05,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 10:39:05,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:39:05,716 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:39:05,716 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:39:05,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096878324] [2025-02-05 10:39:05,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096878324] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:05,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:05,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 10:39:05,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200314815] [2025-02-05 10:39:05,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:05,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 10:39:05,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:39:05,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 10:39:05,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-05 10:39:05,717 INFO L87 Difference]: Start difference. First operand 536 states and 735 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:06,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:06,006 INFO L93 Difference]: Finished difference Result 552 states and 750 transitions. [2025-02-05 10:39:06,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 10:39:06,007 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2025-02-05 10:39:06,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:06,010 INFO L225 Difference]: With dead ends: 552 [2025-02-05 10:39:06,010 INFO L226 Difference]: Without dead ends: 550 [2025-02-05 10:39:06,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-02-05 10:39:06,013 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 60 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:06,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1211 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:39:06,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-02-05 10:39:06,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 540. [2025-02-05 10:39:06,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 488 states have (on average 1.2930327868852458) internal successors, (631), 484 states have internal predecessors, (631), 45 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (62), 57 states have call predecessors, (62), 44 states have call successors, (62) [2025-02-05 10:39:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 738 transitions. [2025-02-05 10:39:06,042 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 738 transitions. Word has length 45 [2025-02-05 10:39:06,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:06,043 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 738 transitions. [2025-02-05 10:39:06,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:06,043 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 738 transitions. [2025-02-05 10:39:06,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 10:39:06,045 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:06,046 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:39:06,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-05 10:39:06,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:06,247 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:06,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:06,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1308887554, now seen corresponding path program 1 times [2025-02-05 10:39:06,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:39:06,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1492779906] [2025-02-05 10:39:06,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:06,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:06,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:06,251 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:39:06,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-05 10:39:06,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 10:39:06,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 10:39:06,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:06,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:06,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:39:06,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:06,322 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:39:06,322 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:39:06,322 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:39:06,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492779906] [2025-02-05 10:39:06,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492779906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:06,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:06,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:39:06,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119821951] [2025-02-05 10:39:06,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:06,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:39:06,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:39:06,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:39:06,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:39:06,324 INFO L87 Difference]: Start difference. First operand 540 states and 738 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:06,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:06,359 INFO L93 Difference]: Finished difference Result 931 states and 1274 transitions. [2025-02-05 10:39:06,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:39:06,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2025-02-05 10:39:06,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:06,363 INFO L225 Difference]: With dead ends: 931 [2025-02-05 10:39:06,365 INFO L226 Difference]: Without dead ends: 839 [2025-02-05 10:39:06,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:39:06,366 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 28 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:06,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 362 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:06,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2025-02-05 10:39:06,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 624. [2025-02-05 10:39:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 563 states have (on average 1.2948490230905862) internal successors, (729), 560 states have internal predecessors, (729), 54 states have call successors, (54), 4 states have call predecessors, (54), 6 states have return successors, (71), 65 states have call predecessors, (71), 53 states have call successors, (71) [2025-02-05 10:39:06,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 854 transitions. [2025-02-05 10:39:06,402 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 854 transitions. Word has length 45 [2025-02-05 10:39:06,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:06,403 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 854 transitions. [2025-02-05 10:39:06,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:06,403 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 854 transitions. [2025-02-05 10:39:06,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 10:39:06,405 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:06,405 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:39:06,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-05 10:39:06,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:06,609 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:06,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:06,609 INFO L85 PathProgramCache]: Analyzing trace with hash 221208401, now seen corresponding path program 1 times [2025-02-05 10:39:06,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:39:06,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1088662763] [2025-02-05 10:39:06,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:06,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:06,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:06,612 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:39:06,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-05 10:39:06,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 10:39:06,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 10:39:06,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:06,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:06,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 10:39:06,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:06,775 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:39:06,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:39:06,955 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:39:06,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088662763] [2025-02-05 10:39:06,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088662763] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:39:06,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1813989698] [2025-02-05 10:39:06,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:06,955 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 10:39:06,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 10:39:06,963 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 10:39:06,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2025-02-05 10:39:07,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 10:39:07,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 10:39:07,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:07,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:07,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 10:39:07,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:07,132 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:39:07,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:39:07,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1813989698] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:39:07,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:39:07,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2025-02-05 10:39:07,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976609135] [2025-02-05 10:39:07,178 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 10:39:07,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 10:39:07,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:39:07,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 10:39:07,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-02-05 10:39:07,179 INFO L87 Difference]: Start difference. First operand 624 states and 854 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:39:07,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:07,424 INFO L93 Difference]: Finished difference Result 646 states and 874 transitions. [2025-02-05 10:39:07,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 10:39:07,425 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2025-02-05 10:39:07,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:07,428 INFO L225 Difference]: With dead ends: 646 [2025-02-05 10:39:07,428 INFO L226 Difference]: Without dead ends: 644 [2025-02-05 10:39:07,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-02-05 10:39:07,429 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 50 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:07,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1064 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:39:07,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-02-05 10:39:07,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 624. [2025-02-05 10:39:07,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 566 states have (on average 1.2932862190812722) internal successors, (732), 559 states have internal predecessors, (732), 50 states have call successors, (50), 5 states have call predecessors, (50), 7 states have return successors, (67), 65 states have call predecessors, (67), 49 states have call successors, (67) [2025-02-05 10:39:07,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 849 transitions. [2025-02-05 10:39:07,468 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 849 transitions. Word has length 45 [2025-02-05 10:39:07,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:07,468 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 849 transitions. [2025-02-05 10:39:07,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:39:07,468 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 849 transitions. [2025-02-05 10:39:07,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 10:39:07,470 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:07,470 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 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-05 10:39:07,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-05 10:39:07,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2025-02-05 10:39:07,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-05 10:39:07,871 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:07,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:07,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1412614062, now seen corresponding path program 1 times [2025-02-05 10:39:07,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:39:07,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1051008340] [2025-02-05 10:39:07,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:07,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:07,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:07,875 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:39:07,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-05 10:39:07,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 10:39:07,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 10:39:07,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:07,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:07,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 10:39:07,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:07,999 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 10:39:07,999 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:39:07,999 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:39:07,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051008340] [2025-02-05 10:39:07,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051008340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:07,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:08,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 10:39:08,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812099982] [2025-02-05 10:39:08,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:08,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 10:39:08,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:39:08,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 10:39:08,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:39:08,001 INFO L87 Difference]: Start difference. First operand 624 states and 849 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:08,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:08,100 INFO L93 Difference]: Finished difference Result 630 states and 854 transitions. [2025-02-05 10:39:08,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 10:39:08,101 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-02-05 10:39:08,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:08,104 INFO L225 Difference]: With dead ends: 630 [2025-02-05 10:39:08,104 INFO L226 Difference]: Without dead ends: 628 [2025-02-05 10:39:08,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:39:08,106 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 3 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:08,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 455 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:39:08,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2025-02-05 10:39:08,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2025-02-05 10:39:08,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 569 states have (on average 1.2917398945518452) internal successors, (735), 562 states have internal predecessors, (735), 50 states have call successors, (50), 6 states have call predecessors, (50), 8 states have return successors, (67), 65 states have call predecessors, (67), 49 states have call successors, (67) [2025-02-05 10:39:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 852 transitions. [2025-02-05 10:39:08,141 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 852 transitions. Word has length 46 [2025-02-05 10:39:08,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:08,142 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 852 transitions. [2025-02-05 10:39:08,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:08,142 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 852 transitions. [2025-02-05 10:39:08,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 10:39:08,144 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:08,144 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-05 10:39:08,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-05 10:39:08,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:08,345 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:08,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:08,346 INFO L85 PathProgramCache]: Analyzing trace with hash 641339642, now seen corresponding path program 1 times [2025-02-05 10:39:08,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:39:08,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [112986046] [2025-02-05 10:39:08,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:08,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:08,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:08,349 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:39:08,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-05 10:39:08,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 10:39:08,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 10:39:08,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:08,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:08,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:39:08,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:08,413 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 10:39:08,414 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:39:08,414 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:39:08,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112986046] [2025-02-05 10:39:08,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112986046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:08,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:08,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:39:08,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922132524] [2025-02-05 10:39:08,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:08,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:39:08,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:39:08,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:39:08,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:39:08,415 INFO L87 Difference]: Start difference. First operand 628 states and 852 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:39:08,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:08,466 INFO L93 Difference]: Finished difference Result 1102 states and 1493 transitions. [2025-02-05 10:39:08,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:39:08,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2025-02-05 10:39:08,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:08,470 INFO L225 Difference]: With dead ends: 1102 [2025-02-05 10:39:08,470 INFO L226 Difference]: Without dead ends: 477 [2025-02-05 10:39:08,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-05 10:39:08,472 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 22 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:08,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 253 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:08,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-02-05 10:39:08,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 466. [2025-02-05 10:39:08,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 418 states have (on average 1.2822966507177034) internal successors, (536), 418 states have internal predecessors, (536), 38 states have call successors, (38), 6 states have call predecessors, (38), 9 states have return successors, (49), 45 states have call predecessors, (49), 37 states have call successors, (49) [2025-02-05 10:39:08,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 623 transitions. [2025-02-05 10:39:08,493 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 623 transitions. Word has length 47 [2025-02-05 10:39:08,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:08,493 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 623 transitions. [2025-02-05 10:39:08,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:39:08,494 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 623 transitions. [2025-02-05 10:39:08,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 10:39:08,495 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:08,495 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:39:08,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-05 10:39:08,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:08,699 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:08,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:08,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1443014461, now seen corresponding path program 1 times [2025-02-05 10:39:08,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:39:08,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1197558557] [2025-02-05 10:39:08,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:08,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:08,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:08,702 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:39:08,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-05 10:39:08,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 10:39:08,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 10:39:08,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:08,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:08,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 10:39:08,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:08,858 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:39:08,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:39:08,942 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:39:08,942 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:39:08,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197558557] [2025-02-05 10:39:08,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197558557] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 10:39:08,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:39:08,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2025-02-05 10:39:08,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290111345] [2025-02-05 10:39:08,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:08,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 10:39:08,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:39:08,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 10:39:08,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-02-05 10:39:08,949 INFO L87 Difference]: Start difference. First operand 466 states and 623 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:09,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:09,147 INFO L93 Difference]: Finished difference Result 665 states and 905 transitions. [2025-02-05 10:39:09,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 10:39:09,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-02-05 10:39:09,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:09,151 INFO L225 Difference]: With dead ends: 665 [2025-02-05 10:39:09,151 INFO L226 Difference]: Without dead ends: 625 [2025-02-05 10:39:09,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-02-05 10:39:09,153 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 23 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:09,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 413 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:39:09,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-02-05 10:39:09,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 476. [2025-02-05 10:39:09,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 422 states have (on average 1.2890995260663507) internal successors, (544), 423 states have internal predecessors, (544), 44 states have call successors, (44), 6 states have call predecessors, (44), 9 states have return successors, (55), 50 states have call predecessors, (55), 43 states have call successors, (55) [2025-02-05 10:39:09,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 643 transitions. [2025-02-05 10:39:09,180 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 643 transitions. Word has length 48 [2025-02-05 10:39:09,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:09,181 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 643 transitions. [2025-02-05 10:39:09,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:09,181 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 643 transitions. [2025-02-05 10:39:09,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 10:39:09,184 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:09,184 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:39:09,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-02-05 10:39:09,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:09,384 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:09,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:09,385 INFO L85 PathProgramCache]: Analyzing trace with hash -353936898, now seen corresponding path program 1 times [2025-02-05 10:39:09,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:39:09,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [89911858] [2025-02-05 10:39:09,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:09,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:09,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:09,387 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:39:09,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-05 10:39:09,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 10:39:09,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 10:39:09,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:09,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:09,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:39:09,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:09,447 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:39:09,447 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:39:09,447 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:39:09,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89911858] [2025-02-05 10:39:09,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89911858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:09,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:09,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:39:09,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102970849] [2025-02-05 10:39:09,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:09,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:39:09,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:39:09,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:39:09,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:39:09,449 INFO L87 Difference]: Start difference. First operand 476 states and 643 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:09,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:09,471 INFO L93 Difference]: Finished difference Result 495 states and 664 transitions. [2025-02-05 10:39:09,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:39:09,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-02-05 10:39:09,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:09,474 INFO L225 Difference]: With dead ends: 495 [2025-02-05 10:39:09,474 INFO L226 Difference]: Without dead ends: 451 [2025-02-05 10:39:09,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:39:09,475 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:09,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 279 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:09,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-02-05 10:39:09,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 448. [2025-02-05 10:39:09,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 394 states have (on average 1.2944162436548223) internal successors, (510), 396 states have internal predecessors, (510), 44 states have call successors, (44), 6 states have call predecessors, (44), 9 states have return successors, (53), 49 states have call predecessors, (53), 43 states have call successors, (53) [2025-02-05 10:39:09,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 607 transitions. [2025-02-05 10:39:09,505 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 607 transitions. Word has length 48 [2025-02-05 10:39:09,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:09,505 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 607 transitions. [2025-02-05 10:39:09,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:09,506 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 607 transitions. [2025-02-05 10:39:09,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 10:39:09,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:09,508 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:39:09,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-02-05 10:39:09,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:09,709 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:09,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:09,709 INFO L85 PathProgramCache]: Analyzing trace with hash -930637242, now seen corresponding path program 1 times [2025-02-05 10:39:09,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:39:09,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2067013791] [2025-02-05 10:39:09,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:09,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:09,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:09,712 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:39:09,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-05 10:39:09,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 10:39:09,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 10:39:09,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:09,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:09,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 10:39:09,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:09,916 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:39:09,916 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:39:09,916 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:39:09,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067013791] [2025-02-05 10:39:09,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067013791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:09,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:09,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 10:39:09,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573467085] [2025-02-05 10:39:09,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:09,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 10:39:09,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:39:09,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 10:39:09,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-05 10:39:09,917 INFO L87 Difference]: Start difference. First operand 448 states and 607 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:10,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:10,222 INFO L93 Difference]: Finished difference Result 532 states and 717 transitions. [2025-02-05 10:39:10,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 10:39:10,223 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2025-02-05 10:39:10,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:10,225 INFO L225 Difference]: With dead ends: 532 [2025-02-05 10:39:10,225 INFO L226 Difference]: Without dead ends: 491 [2025-02-05 10:39:10,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-02-05 10:39:10,226 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 74 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:10,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 717 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:39:10,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-02-05 10:39:10,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 478. [2025-02-05 10:39:10,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 420 states have (on average 1.2738095238095237) internal successors, (535), 424 states have internal predecessors, (535), 48 states have call successors, (48), 6 states have call predecessors, (48), 9 states have return successors, (56), 52 states have call predecessors, (56), 46 states have call successors, (56) [2025-02-05 10:39:10,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 639 transitions. [2025-02-05 10:39:10,248 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 639 transitions. Word has length 50 [2025-02-05 10:39:10,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:10,248 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 639 transitions. [2025-02-05 10:39:10,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:10,248 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 639 transitions. [2025-02-05 10:39:10,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 10:39:10,249 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:10,249 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:39:10,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-02-05 10:39:10,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:10,451 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:10,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:10,451 INFO L85 PathProgramCache]: Analyzing trace with hash -946034181, now seen corresponding path program 1 times [2025-02-05 10:39:10,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:39:10,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1503033248] [2025-02-05 10:39:10,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:10,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:10,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:10,454 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:39:10,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-02-05 10:39:10,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 10:39:10,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 10:39:10,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:10,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:10,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:39:10,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:10,530 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:39:10,531 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:39:10,531 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:39:10,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503033248] [2025-02-05 10:39:10,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503033248] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:10,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:10,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:39:10,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863053676] [2025-02-05 10:39:10,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:10,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:39:10,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:39:10,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:39:10,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:39:10,533 INFO L87 Difference]: Start difference. First operand 478 states and 639 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:10,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:10,560 INFO L93 Difference]: Finished difference Result 521 states and 692 transitions. [2025-02-05 10:39:10,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:39:10,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2025-02-05 10:39:10,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:10,563 INFO L225 Difference]: With dead ends: 521 [2025-02-05 10:39:10,563 INFO L226 Difference]: Without dead ends: 478 [2025-02-05 10:39:10,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:39:10,564 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 26 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:10,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 275 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:39:10,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-02-05 10:39:10,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2025-02-05 10:39:10,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 420 states have (on average 1.2333333333333334) internal successors, (518), 424 states have internal predecessors, (518), 48 states have call successors, (48), 6 states have call predecessors, (48), 9 states have return successors, (56), 52 states have call predecessors, (56), 46 states have call successors, (56) [2025-02-05 10:39:10,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 622 transitions. [2025-02-05 10:39:10,606 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 622 transitions. Word has length 50 [2025-02-05 10:39:10,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:10,606 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 622 transitions. [2025-02-05 10:39:10,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:10,606 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 622 transitions. [2025-02-05 10:39:10,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 10:39:10,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:10,608 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:39:10,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-02-05 10:39:10,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:10,812 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:10,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:10,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1310876826, now seen corresponding path program 1 times [2025-02-05 10:39:10,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:39:10,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [258841426] [2025-02-05 10:39:10,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:10,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:10,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:10,815 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:39:10,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-02-05 10:39:10,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 10:39:10,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 10:39:10,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:10,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:10,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 10:39:10,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:10,959 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:39:10,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:39:11,077 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:39:11,078 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:39:11,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258841426] [2025-02-05 10:39:11,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258841426] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:39:11,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:39:11,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2025-02-05 10:39:11,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345306858] [2025-02-05 10:39:11,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 10:39:11,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 10:39:11,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:39:11,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 10:39:11,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-02-05 10:39:11,080 INFO L87 Difference]: Start difference. First operand 478 states and 622 transitions. Second operand has 16 states, 14 states have (on average 3.5) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-05 10:39:11,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:11,265 INFO L93 Difference]: Finished difference Result 527 states and 672 transitions. [2025-02-05 10:39:11,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 10:39:11,266 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.5) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 50 [2025-02-05 10:39:11,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:11,267 INFO L225 Difference]: With dead ends: 527 [2025-02-05 10:39:11,268 INFO L226 Difference]: Without dead ends: 448 [2025-02-05 10:39:11,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-02-05 10:39:11,269 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 12 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:11,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1010 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:39:11,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-02-05 10:39:11,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 445. [2025-02-05 10:39:11,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 391 states have (on average 1.227621483375959) internal successors, (480), 394 states have internal predecessors, (480), 44 states have call successors, (44), 6 states have call predecessors, (44), 9 states have return successors, (52), 49 states have call predecessors, (52), 42 states have call successors, (52) [2025-02-05 10:39:11,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 576 transitions. [2025-02-05 10:39:11,289 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 576 transitions. Word has length 50 [2025-02-05 10:39:11,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:11,290 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 576 transitions. [2025-02-05 10:39:11,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.5) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-05 10:39:11,290 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 576 transitions. [2025-02-05 10:39:11,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 10:39:11,291 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:11,292 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:39:11,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-02-05 10:39:11,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:11,493 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:11,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:11,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1945628830, now seen corresponding path program 1 times [2025-02-05 10:39:11,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:39:11,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [334830803] [2025-02-05 10:39:11,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:11,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:11,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:11,495 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:39:11,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-02-05 10:39:11,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 10:39:11,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 10:39:11,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:11,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:11,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 10:39:11,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:27,870 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:39:27,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:39:27,870 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:39:27,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334830803] [2025-02-05 10:39:27,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334830803] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:27,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:27,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 10:39:27,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741363865] [2025-02-05 10:39:27,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:27,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 10:39:27,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:39:27,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 10:39:27,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=49, Unknown=7, NotChecked=0, Total=72 [2025-02-05 10:39:27,871 INFO L87 Difference]: Start difference. First operand 445 states and 576 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:29,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:39:31,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:39:33,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:39:35,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:39:36,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:39:38,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:39:40,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:39:42,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:39:43,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:39:47,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:39:49,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:39:51,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:39:53,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:39:55,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 10:39:56,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]