./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label38.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/eca-rers2012/Problem03_label38.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 d6ab095cb4c47e2e0ab83610e7dceb2c658ebc8f7a2b4be1c26690c64da4af60 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:47:28,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:47:28,490 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:47:28,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:47:28,493 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:47:28,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:47:28,507 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:47:28,507 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:47:28,508 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:47:28,508 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:47:28,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:47:28,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:47:28,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:47:28,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:47:28,508 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:47:28,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:47:28,508 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:47:28,508 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:47:28,508 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:47:28,508 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:47:28,508 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:47:28,508 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:47:28,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:47:28,509 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:47:28,509 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:47:28,509 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:47:28,509 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:47:28,509 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:47:28,509 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:47:28,509 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:47:28,509 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:47:28,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:47:28,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:47:28,509 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:47:28,509 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:47:28,509 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:47:28,509 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:47:28,509 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:47:28,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:47:28,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:47:28,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:47:28,510 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:47:28,510 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:47:28,510 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 -> d6ab095cb4c47e2e0ab83610e7dceb2c658ebc8f7a2b4be1c26690c64da4af60 [2025-02-05 10:47:28,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:47:28,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:47:28,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:47:28,735 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:47:28,735 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:47:28,736 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label38.c [2025-02-05 10:47:29,907 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61d44ac82/5bc8de2373024b8f8eec12e078e13715/FLAGcaff40af5 [2025-02-05 10:47:30,283 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:47:30,285 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label38.c [2025-02-05 10:47:30,305 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61d44ac82/5bc8de2373024b8f8eec12e078e13715/FLAGcaff40af5 [2025-02-05 10:47:30,500 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61d44ac82/5bc8de2373024b8f8eec12e078e13715 [2025-02-05 10:47:30,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:47:30,510 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:47:30,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:47:30,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:47:30,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:47:30,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:47:30" (1/1) ... [2025-02-05 10:47:30,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3981c6b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:30, skipping insertion in model container [2025-02-05 10:47:30,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:47:30" (1/1) ... [2025-02-05 10:47:30,571 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:47:30,921 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/eca-rers2012/Problem03_label38.c[61364,61377] [2025-02-05 10:47:30,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:47:30,958 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:47:31,077 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/eca-rers2012/Problem03_label38.c[61364,61377] [2025-02-05 10:47:31,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:47:31,100 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:47:31,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:31 WrapperNode [2025-02-05 10:47:31,102 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:47:31,103 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:47:31,103 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:47:31,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:47:31,108 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:47:31" (1/1) ... [2025-02-05 10:47:31,141 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:47:31" (1/1) ... [2025-02-05 10:47:31,230 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-02-05 10:47:31,230 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:47:31,231 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:47:31,231 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:47:31,231 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:47:31,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:31" (1/1) ... [2025-02-05 10:47:31,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:31" (1/1) ... [2025-02-05 10:47:31,251 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:31" (1/1) ... [2025-02-05 10:47:31,286 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:47:31,286 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:31" (1/1) ... [2025-02-05 10:47:31,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:31" (1/1) ... [2025-02-05 10:47:31,324 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:31" (1/1) ... [2025-02-05 10:47:31,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:31" (1/1) ... [2025-02-05 10:47:31,334 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:31" (1/1) ... [2025-02-05 10:47:31,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:31" (1/1) ... [2025-02-05 10:47:31,414 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:47:31,416 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:47:31,416 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:47:31,416 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:47:31,417 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:31" (1/1) ... [2025-02-05 10:47:31,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:47:31,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:47:31,443 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:47:31,445 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:47:31,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:47:31,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:47:31,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:47:31,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:47:31,527 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:47:31,528 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:47:32,920 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-02-05 10:47:32,920 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:47:32,938 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:47:32,938 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:47:32,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:47:32 BoogieIcfgContainer [2025-02-05 10:47:32,939 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:47:32,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:47:32,940 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:47:32,946 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:47:32,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:47:30" (1/3) ... [2025-02-05 10:47:32,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ddfa945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:47:32, skipping insertion in model container [2025-02-05 10:47:32,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:31" (2/3) ... [2025-02-05 10:47:32,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ddfa945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:47:32, skipping insertion in model container [2025-02-05 10:47:32,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:47:32" (3/3) ... [2025-02-05 10:47:32,949 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label38.c [2025-02-05 10:47:32,960 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:47:32,963 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label38.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 10:47:33,013 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:47:33,021 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;@36cf9723, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:47:33,021 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:47:33,028 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:33,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-05 10:47:33,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:33,037 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:33,037 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:33,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:33,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1728890963, now seen corresponding path program 1 times [2025-02-05 10:47:33,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:33,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063070845] [2025-02-05 10:47:33,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:33,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:33,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 10:47:33,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 10:47:33,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:33,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:33,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:47:33,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:33,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063070845] [2025-02-05 10:47:33,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063070845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:33,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:47:33,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:47:33,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039431486] [2025-02-05 10:47:33,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:33,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:33,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:33,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:33,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:47:33,784 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:34,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:34,670 INFO L93 Difference]: Finished difference Result 855 states and 1493 transitions. [2025-02-05 10:47:34,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:34,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 201 [2025-02-05 10:47:34,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:34,679 INFO L225 Difference]: With dead ends: 855 [2025-02-05 10:47:34,679 INFO L226 Difference]: Without dead ends: 460 [2025-02-05 10:47:34,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:47:34,684 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 95 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:34,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 175 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 10:47:34,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-02-05 10:47:34,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 459. [2025-02-05 10:47:34,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.5502183406113537) internal successors, (710), 458 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:34,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 710 transitions. [2025-02-05 10:47:34,723 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 710 transitions. Word has length 201 [2025-02-05 10:47:34,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:34,724 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 710 transitions. [2025-02-05 10:47:34,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:34,724 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 710 transitions. [2025-02-05 10:47:34,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-05 10:47:34,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:34,727 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:34,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:47:34,727 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:34,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:34,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1603825751, now seen corresponding path program 1 times [2025-02-05 10:47:34,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:34,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255940021] [2025-02-05 10:47:34,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:34,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:34,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-05 10:47:34,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-05 10:47:34,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:34,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:35,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:47:35,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:35,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255940021] [2025-02-05 10:47:35,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255940021] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:35,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:47:35,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:47:35,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376879336] [2025-02-05 10:47:35,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:35,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:35,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:35,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:35,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:47:35,006 INFO L87 Difference]: Start difference. First operand 459 states and 710 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:35,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:35,226 INFO L93 Difference]: Finished difference Result 1372 states and 2125 transitions. [2025-02-05 10:47:35,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:35,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-02-05 10:47:35,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:35,236 INFO L225 Difference]: With dead ends: 1372 [2025-02-05 10:47:35,236 INFO L226 Difference]: Without dead ends: 915 [2025-02-05 10:47:35,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:47:35,238 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 366 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:35,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 596 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:47:35,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2025-02-05 10:47:35,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 913. [2025-02-05 10:47:35,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 912 states have (on average 1.5460526315789473) internal successors, (1410), 912 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:35,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1410 transitions. [2025-02-05 10:47:35,274 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1410 transitions. Word has length 206 [2025-02-05 10:47:35,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:35,274 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1410 transitions. [2025-02-05 10:47:35,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:35,275 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1410 transitions. [2025-02-05 10:47:35,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-02-05 10:47:35,279 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:35,279 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:35,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:47:35,279 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:35,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:35,280 INFO L85 PathProgramCache]: Analyzing trace with hash 75285949, now seen corresponding path program 1 times [2025-02-05 10:47:35,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:35,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304931735] [2025-02-05 10:47:35,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:35,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:35,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-05 10:47:35,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-05 10:47:35,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:35,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:35,446 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:47:35,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:35,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304931735] [2025-02-05 10:47:35,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304931735] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:35,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:47:35,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:47:35,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893153512] [2025-02-05 10:47:35,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:35,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:35,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:35,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:35,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:47:35,449 INFO L87 Difference]: Start difference. First operand 913 states and 1410 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:36,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:36,136 INFO L93 Difference]: Finished difference Result 2685 states and 4171 transitions. [2025-02-05 10:47:36,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:36,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 209 [2025-02-05 10:47:36,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:36,142 INFO L225 Difference]: With dead ends: 2685 [2025-02-05 10:47:36,142 INFO L226 Difference]: Without dead ends: 1774 [2025-02-05 10:47:36,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:47:36,143 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 236 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:36,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 154 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:47:36,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2025-02-05 10:47:36,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1738. [2025-02-05 10:47:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1737 states have (on average 1.5135290731145654) internal successors, (2629), 1737 states have internal predecessors, (2629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:36,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2629 transitions. [2025-02-05 10:47:36,191 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2629 transitions. Word has length 209 [2025-02-05 10:47:36,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:36,192 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2629 transitions. [2025-02-05 10:47:36,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:36,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2629 transitions. [2025-02-05 10:47:36,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 10:47:36,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:36,214 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:36,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:47:36,215 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:36,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:36,216 INFO L85 PathProgramCache]: Analyzing trace with hash 564315628, now seen corresponding path program 1 times [2025-02-05 10:47:36,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:36,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082751083] [2025-02-05 10:47:36,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:36,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:36,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 10:47:36,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 10:47:36,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:36,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:47:36,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:36,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082751083] [2025-02-05 10:47:36,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082751083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:36,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:47:36,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:47:36,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629355271] [2025-02-05 10:47:36,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:36,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:36,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:36,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:36,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:47:36,363 INFO L87 Difference]: Start difference. First operand 1738 states and 2629 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:36,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:36,655 INFO L93 Difference]: Finished difference Result 5178 states and 7843 transitions. [2025-02-05 10:47:36,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:36,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 215 [2025-02-05 10:47:36,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:36,665 INFO L225 Difference]: With dead ends: 5178 [2025-02-05 10:47:36,666 INFO L226 Difference]: Without dead ends: 3442 [2025-02-05 10:47:36,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:47:36,669 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 349 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:36,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 513 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:47:36,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2025-02-05 10:47:36,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 3438. [2025-02-05 10:47:36,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3438 states, 3437 states have (on average 1.5074192609834158) internal successors, (5181), 3437 states have internal predecessors, (5181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:36,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 5181 transitions. [2025-02-05 10:47:36,724 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 5181 transitions. Word has length 215 [2025-02-05 10:47:36,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:36,724 INFO L471 AbstractCegarLoop]: Abstraction has 3438 states and 5181 transitions. [2025-02-05 10:47:36,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:36,724 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 5181 transitions. [2025-02-05 10:47:36,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-02-05 10:47:36,730 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:36,730 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:36,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:47:36,730 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:36,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:36,731 INFO L85 PathProgramCache]: Analyzing trace with hash 578488890, now seen corresponding path program 1 times [2025-02-05 10:47:36,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:36,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287101268] [2025-02-05 10:47:36,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:36,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:36,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-05 10:47:36,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-05 10:47:36,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:36,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:36,972 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 10:47:36,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:36,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287101268] [2025-02-05 10:47:36,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287101268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:36,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:47:36,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:47:36,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192178452] [2025-02-05 10:47:36,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:36,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:36,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:36,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:36,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:47:36,974 INFO L87 Difference]: Start difference. First operand 3438 states and 5181 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 2 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:37,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:37,621 INFO L93 Difference]: Finished difference Result 8539 states and 12821 transitions. [2025-02-05 10:47:37,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:37,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 2 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 216 [2025-02-05 10:47:37,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:37,636 INFO L225 Difference]: With dead ends: 8539 [2025-02-05 10:47:37,636 INFO L226 Difference]: Without dead ends: 5103 [2025-02-05 10:47:37,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:47:37,641 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 234 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:37,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 114 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:47:37,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5103 states. [2025-02-05 10:47:37,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5103 to 5099. [2025-02-05 10:47:37,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5099 states, 5098 states have (on average 1.4731267163593567) internal successors, (7510), 5098 states have internal predecessors, (7510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:37,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5099 states to 5099 states and 7510 transitions. [2025-02-05 10:47:37,746 INFO L78 Accepts]: Start accepts. Automaton has 5099 states and 7510 transitions. Word has length 216 [2025-02-05 10:47:37,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:37,746 INFO L471 AbstractCegarLoop]: Abstraction has 5099 states and 7510 transitions. [2025-02-05 10:47:37,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 2 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:37,746 INFO L276 IsEmpty]: Start isEmpty. Operand 5099 states and 7510 transitions. [2025-02-05 10:47:37,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-02-05 10:47:37,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:37,754 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:37,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 10:47:37,754 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:37,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:37,754 INFO L85 PathProgramCache]: Analyzing trace with hash 483559679, now seen corresponding path program 1 times [2025-02-05 10:47:37,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:37,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011137479] [2025-02-05 10:47:37,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:37,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:37,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-02-05 10:47:37,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-02-05 10:47:37,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:37,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:37,885 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 10:47:37,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:37,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011137479] [2025-02-05 10:47:37,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011137479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:37,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:47:37,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:47:37,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294765576] [2025-02-05 10:47:37,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:37,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:37,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:37,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:37,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:47:37,887 INFO L87 Difference]: Start difference. First operand 5099 states and 7510 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:38,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:38,203 INFO L93 Difference]: Finished difference Result 15193 states and 22394 transitions. [2025-02-05 10:47:38,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:38,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 223 [2025-02-05 10:47:38,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:38,233 INFO L225 Difference]: With dead ends: 15193 [2025-02-05 10:47:38,233 INFO L226 Difference]: Without dead ends: 10096 [2025-02-05 10:47:38,241 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:47:38,243 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 359 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:38,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 585 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:47:38,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10096 states. [2025-02-05 10:47:38,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10096 to 10090. [2025-02-05 10:47:38,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10090 states, 10089 states have (on average 1.473386856972941) internal successors, (14865), 10089 states have internal predecessors, (14865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:38,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10090 states to 10090 states and 14865 transitions. [2025-02-05 10:47:38,437 INFO L78 Accepts]: Start accepts. Automaton has 10090 states and 14865 transitions. Word has length 223 [2025-02-05 10:47:38,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:38,437 INFO L471 AbstractCegarLoop]: Abstraction has 10090 states and 14865 transitions. [2025-02-05 10:47:38,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:38,437 INFO L276 IsEmpty]: Start isEmpty. Operand 10090 states and 14865 transitions. [2025-02-05 10:47:38,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-02-05 10:47:38,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:38,451 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:38,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 10:47:38,452 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:38,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:38,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2008002121, now seen corresponding path program 1 times [2025-02-05 10:47:38,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:38,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845190429] [2025-02-05 10:47:38,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:38,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:38,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-02-05 10:47:38,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-02-05 10:47:38,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:38,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:38,708 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:47:38,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:38,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845190429] [2025-02-05 10:47:38,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845190429] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:47:38,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211540605] [2025-02-05 10:47:38,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:38,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:47:38,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:47:38,710 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:47:38,712 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:47:38,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-02-05 10:47:38,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-02-05 10:47:38,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:38,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:38,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:47:38,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:47:38,903 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:47:38,903 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:47:38,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211540605] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:38,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:47:38,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 10:47:38,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733258662] [2025-02-05 10:47:38,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:38,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:38,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:38,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:38,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:47:38,909 INFO L87 Difference]: Start difference. First operand 10090 states and 14865 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:39,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:39,644 INFO L93 Difference]: Finished difference Result 29938 states and 44140 transitions. [2025-02-05 10:47:39,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:39,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 223 [2025-02-05 10:47:39,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:39,692 INFO L225 Difference]: With dead ends: 29938 [2025-02-05 10:47:39,692 INFO L226 Difference]: Without dead ends: 19850 [2025-02-05 10:47:39,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:47:39,709 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 223 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:39,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 429 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:47:39,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19850 states. [2025-02-05 10:47:40,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19850 to 19834. [2025-02-05 10:47:40,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19834 states, 19833 states have (on average 1.3025260928755105) internal successors, (25833), 19833 states have internal predecessors, (25833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:40,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19834 states to 19834 states and 25833 transitions. [2025-02-05 10:47:40,076 INFO L78 Accepts]: Start accepts. Automaton has 19834 states and 25833 transitions. Word has length 223 [2025-02-05 10:47:40,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:40,076 INFO L471 AbstractCegarLoop]: Abstraction has 19834 states and 25833 transitions. [2025-02-05 10:47:40,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:40,077 INFO L276 IsEmpty]: Start isEmpty. Operand 19834 states and 25833 transitions. [2025-02-05 10:47:40,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-02-05 10:47:40,094 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:40,094 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:40,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 10:47:40,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:47:40,298 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:40,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:40,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1536349023, now seen corresponding path program 1 times [2025-02-05 10:47:40,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:40,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751953258] [2025-02-05 10:47:40,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:40,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:40,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-02-05 10:47:40,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-02-05 10:47:40,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:40,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:40,418 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 10:47:40,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:40,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751953258] [2025-02-05 10:47:40,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751953258] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:40,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:47:40,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:47:40,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573193491] [2025-02-05 10:47:40,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:40,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:40,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:40,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:40,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:47:40,420 INFO L87 Difference]: Start difference. First operand 19834 states and 25833 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:41,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:41,274 INFO L93 Difference]: Finished difference Result 59228 states and 77124 transitions. [2025-02-05 10:47:41,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:41,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 223 [2025-02-05 10:47:41,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:41,338 INFO L225 Difference]: With dead ends: 59228 [2025-02-05 10:47:41,339 INFO L226 Difference]: Without dead ends: 39396 [2025-02-05 10:47:41,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:47:41,367 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 239 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:41,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 162 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:47:41,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39396 states. [2025-02-05 10:47:41,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39396 to 39380. [2025-02-05 10:47:41,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39380 states, 39379 states have (on average 1.2545011300439322) internal successors, (49401), 39379 states have internal predecessors, (49401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:42,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39380 states to 39380 states and 49401 transitions. [2025-02-05 10:47:42,210 INFO L78 Accepts]: Start accepts. Automaton has 39380 states and 49401 transitions. Word has length 223 [2025-02-05 10:47:42,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:42,210 INFO L471 AbstractCegarLoop]: Abstraction has 39380 states and 49401 transitions. [2025-02-05 10:47:42,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:42,210 INFO L276 IsEmpty]: Start isEmpty. Operand 39380 states and 49401 transitions. [2025-02-05 10:47:42,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-02-05 10:47:42,238 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:42,238 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:42,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 10:47:42,239 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:42,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:42,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1065795501, now seen corresponding path program 1 times [2025-02-05 10:47:42,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:42,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935584979] [2025-02-05 10:47:42,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:42,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:42,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-02-05 10:47:42,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-02-05 10:47:42,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:42,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:42,731 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:47:42,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:42,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935584979] [2025-02-05 10:47:42,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935584979] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:47:42,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754708482] [2025-02-05 10:47:42,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:42,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:47:42,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:47:42,734 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:47:42,739 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:47:42,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-02-05 10:47:42,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-02-05 10:47:42,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:42,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:42,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:47:42,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:47:43,085 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:47:43,086 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:47:43,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754708482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:43,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:47:43,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-02-05 10:47:43,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942211615] [2025-02-05 10:47:43,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:43,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:43,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:43,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:43,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:47:43,087 INFO L87 Difference]: Start difference. First operand 39380 states and 49401 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:43,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:43,977 INFO L93 Difference]: Finished difference Result 112779 states and 141634 transitions. [2025-02-05 10:47:43,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:43,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 249 [2025-02-05 10:47:43,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:44,116 INFO L225 Difference]: With dead ends: 112779 [2025-02-05 10:47:44,116 INFO L226 Difference]: Without dead ends: 73401 [2025-02-05 10:47:44,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:47:44,160 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 48 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:44,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 405 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:47:44,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73401 states. [2025-02-05 10:47:45,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73401 to 73345. [2025-02-05 10:47:45,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73345 states, 73344 states have (on average 1.2222540357766143) internal successors, (89645), 73344 states have internal predecessors, (89645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:45,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73345 states to 73345 states and 89645 transitions. [2025-02-05 10:47:45,377 INFO L78 Accepts]: Start accepts. Automaton has 73345 states and 89645 transitions. Word has length 249 [2025-02-05 10:47:45,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:45,377 INFO L471 AbstractCegarLoop]: Abstraction has 73345 states and 89645 transitions. [2025-02-05 10:47:45,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:45,378 INFO L276 IsEmpty]: Start isEmpty. Operand 73345 states and 89645 transitions. [2025-02-05 10:47:45,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-02-05 10:47:45,429 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:45,429 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:45,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 10:47:45,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:47:45,630 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:45,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:45,630 INFO L85 PathProgramCache]: Analyzing trace with hash -386876400, now seen corresponding path program 1 times [2025-02-05 10:47:45,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:45,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525776544] [2025-02-05 10:47:45,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:45,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:45,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-02-05 10:47:45,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-02-05 10:47:45,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:45,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:46,528 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 61 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 10:47:46,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:46,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525776544] [2025-02-05 10:47:46,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525776544] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:47:46,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035749916] [2025-02-05 10:47:46,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:46,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:47:46,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:47:46,533 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:47:46,534 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:47:46,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-02-05 10:47:46,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-02-05 10:47:46,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:46,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:46,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:47:46,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:47:46,857 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 10:47:46,858 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:47:46,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035749916] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:46,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:47:46,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:47:46,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100977352] [2025-02-05 10:47:46,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:46,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:46,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:46,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:46,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:47:46,860 INFO L87 Difference]: Start difference. First operand 73345 states and 89645 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:47,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:47,816 INFO L93 Difference]: Finished difference Result 175936 states and 219000 transitions. [2025-02-05 10:47:47,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:47,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 259 [2025-02-05 10:47:47,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:47,955 INFO L225 Difference]: With dead ends: 175936 [2025-02-05 10:47:47,956 INFO L226 Difference]: Without dead ends: 102593 [2025-02-05 10:47:48,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:47:48,020 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 52 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:48,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 398 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:47:48,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102593 states. [2025-02-05 10:47:49,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102593 to 102577. [2025-02-05 10:47:49,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102577 states, 102576 states have (on average 1.2452425518639838) internal successors, (127732), 102576 states have internal predecessors, (127732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:49,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102577 states to 102577 states and 127732 transitions. [2025-02-05 10:47:49,616 INFO L78 Accepts]: Start accepts. Automaton has 102577 states and 127732 transitions. Word has length 259 [2025-02-05 10:47:49,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:49,617 INFO L471 AbstractCegarLoop]: Abstraction has 102577 states and 127732 transitions. [2025-02-05 10:47:49,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:49,617 INFO L276 IsEmpty]: Start isEmpty. Operand 102577 states and 127732 transitions. [2025-02-05 10:47:49,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-02-05 10:47:49,668 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:49,669 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:49,675 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:47:49,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:47:49,869 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:49,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:49,870 INFO L85 PathProgramCache]: Analyzing trace with hash -667046988, now seen corresponding path program 1 times [2025-02-05 10:47:49,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:49,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954745825] [2025-02-05 10:47:49,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:49,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:49,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-02-05 10:47:49,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-02-05 10:47:49,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:49,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:50,435 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 72 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 10:47:50,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:50,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954745825] [2025-02-05 10:47:50,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954745825] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:47:50,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429063219] [2025-02-05 10:47:50,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:50,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:47:50,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:47:50,438 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:47:50,439 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:47:50,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-02-05 10:47:50,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-02-05 10:47:50,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:50,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:50,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:47:50,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:47:50,575 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:47:50,575 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:47:50,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429063219] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:50,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:47:50,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-02-05 10:47:50,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146556219] [2025-02-05 10:47:50,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:50,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:50,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:50,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:50,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:47:50,576 INFO L87 Difference]: Start difference. First operand 102577 states and 127732 transitions. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:51,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:51,642 INFO L93 Difference]: Finished difference Result 205166 states and 255486 transitions. [2025-02-05 10:47:51,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:51,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 268 [2025-02-05 10:47:51,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:51,938 INFO L225 Difference]: With dead ends: 205166 [2025-02-05 10:47:51,939 INFO L226 Difference]: Without dead ends: 102591 [2025-02-05 10:47:52,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:47:52,077 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 228 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:52,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 166 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:47:52,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102591 states. [2025-02-05 10:47:53,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102591 to 102575. [2025-02-05 10:47:53,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102575 states, 102574 states have (on average 1.1755805564763) internal successors, (120584), 102574 states have internal predecessors, (120584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:53,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102575 states to 102575 states and 120584 transitions. [2025-02-05 10:47:53,734 INFO L78 Accepts]: Start accepts. Automaton has 102575 states and 120584 transitions. Word has length 268 [2025-02-05 10:47:53,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:53,735 INFO L471 AbstractCegarLoop]: Abstraction has 102575 states and 120584 transitions. [2025-02-05 10:47:53,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:53,735 INFO L276 IsEmpty]: Start isEmpty. Operand 102575 states and 120584 transitions. [2025-02-05 10:47:53,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-02-05 10:47:53,775 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:53,775 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:53,781 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:47:53,975 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,SelfDestructingSolverStorable10 [2025-02-05 10:47:53,976 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:53,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:53,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1590695537, now seen corresponding path program 1 times [2025-02-05 10:47:53,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:53,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336615255] [2025-02-05 10:47:53,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:53,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:54,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-02-05 10:47:54,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-02-05 10:47:54,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:54,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-05 10:47:54,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:47:54,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336615255] [2025-02-05 10:47:54,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336615255] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:47:54,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486705647] [2025-02-05 10:47:54,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:54,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:47:54,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:47:54,818 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:47:54,819 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:47:54,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-02-05 10:47:54,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-02-05 10:47:54,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:54,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:47:54,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:47:54,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:47:54,995 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 10:47:54,996 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:47:54,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486705647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:47:54,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:47:54,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:47:55,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053004750] [2025-02-05 10:47:55,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:47:55,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:47:55,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:47:55,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:47:55,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:47:55,002 INFO L87 Difference]: Start difference. First operand 102575 states and 120584 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:55,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:47:55,757 INFO L93 Difference]: Finished difference Result 294553 states and 346713 transitions. [2025-02-05 10:47:55,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:47:55,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 278 [2025-02-05 10:47:55,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:47:56,021 INFO L225 Difference]: With dead ends: 294553 [2025-02-05 10:47:56,022 INFO L226 Difference]: Without dead ends: 191980 [2025-02-05 10:47:56,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 277 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:47:56,119 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 308 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:47:56,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 876 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:47:56,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191980 states. [2025-02-05 10:47:58,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191980 to 188730. [2025-02-05 10:47:58,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188730 states, 188729 states have (on average 1.1598323522087226) internal successors, (218894), 188729 states have internal predecessors, (218894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:59,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188730 states to 188730 states and 218894 transitions. [2025-02-05 10:47:59,046 INFO L78 Accepts]: Start accepts. Automaton has 188730 states and 218894 transitions. Word has length 278 [2025-02-05 10:47:59,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:47:59,047 INFO L471 AbstractCegarLoop]: Abstraction has 188730 states and 218894 transitions. [2025-02-05 10:47:59,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:47:59,047 INFO L276 IsEmpty]: Start isEmpty. Operand 188730 states and 218894 transitions. [2025-02-05 10:47:59,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-02-05 10:47:59,100 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:47:59,100 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:59,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 10:47:59,301 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,SelfDestructingSolverStorable11 [2025-02-05 10:47:59,301 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:47:59,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:47:59,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1932561861, now seen corresponding path program 1 times [2025-02-05 10:47:59,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:47:59,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603906955] [2025-02-05 10:47:59,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:47:59,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:47:59,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-02-05 10:47:59,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-02-05 10:47:59,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:47:59,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:00,100 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-02-05 10:48:00,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:48:00,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603906955] [2025-02-05 10:48:00,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603906955] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:48:00,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356292901] [2025-02-05 10:48:00,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:00,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:48:00,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:48:00,103 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:48:00,104 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:48:00,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-02-05 10:48:00,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-02-05 10:48:00,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:00,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:00,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:48:00,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:48:00,254 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 10:48:00,255 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:48:00,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356292901] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:48:00,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:48:00,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:48:00,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643495915] [2025-02-05 10:48:00,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:48:00,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:48:00,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:48:00,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:48:00,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:48:00,256 INFO L87 Difference]: Start difference. First operand 188730 states and 218894 transitions. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:48:01,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:48:01,603 INFO L93 Difference]: Finished difference Result 365885 states and 423990 transitions. [2025-02-05 10:48:01,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:48:01,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 282 [2025-02-05 10:48:01,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:48:01,845 INFO L225 Difference]: With dead ends: 365885 [2025-02-05 10:48:01,845 INFO L226 Difference]: Without dead ends: 177157 [2025-02-05 10:48:01,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 281 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:48:01,958 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 214 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:48:01,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 371 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:48:02,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177157 states. [2025-02-05 10:48:04,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177157 to 176956. [2025-02-05 10:48:04,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176956 states, 176955 states have (on average 1.1503037495408437) internal successors, (203552), 176955 states have internal predecessors, (203552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:48:05,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176956 states to 176956 states and 203552 transitions. [2025-02-05 10:48:05,182 INFO L78 Accepts]: Start accepts. Automaton has 176956 states and 203552 transitions. Word has length 282 [2025-02-05 10:48:05,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:48:05,182 INFO L471 AbstractCegarLoop]: Abstraction has 176956 states and 203552 transitions. [2025-02-05 10:48:05,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:48:05,182 INFO L276 IsEmpty]: Start isEmpty. Operand 176956 states and 203552 transitions. [2025-02-05 10:48:05,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-02-05 10:48:05,236 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:48:05,236 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:05,242 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:48:05,436 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,SelfDestructingSolverStorable12 [2025-02-05 10:48:05,437 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:48:05,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:48:05,437 INFO L85 PathProgramCache]: Analyzing trace with hash 634007564, now seen corresponding path program 1 times [2025-02-05 10:48:05,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:48:05,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992772390] [2025-02-05 10:48:05,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:05,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:48:05,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-02-05 10:48:05,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-02-05 10:48:05,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:05,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:06,324 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 97 proven. 6 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-02-05 10:48:06,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:48:06,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992772390] [2025-02-05 10:48:06,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992772390] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:48:06,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490907486] [2025-02-05 10:48:06,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:06,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:48:06,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:48:06,327 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:48:06,328 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:48:06,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-02-05 10:48:06,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-02-05 10:48:06,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:06,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:06,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:48:06,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:48:06,495 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-02-05 10:48:06,495 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:48:06,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490907486] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:48:06,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:48:06,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:48:06,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369887670] [2025-02-05 10:48:06,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:48:06,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:48:06,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:48:06,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:48:06,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:48:06,497 INFO L87 Difference]: Start difference. First operand 176956 states and 203552 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:48:07,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:48:07,872 INFO L93 Difference]: Finished difference Result 395321 states and 456591 transitions. [2025-02-05 10:48:07,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:48:07,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 284 [2025-02-05 10:48:07,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:48:08,183 INFO L225 Difference]: With dead ends: 395321 [2025-02-05 10:48:08,183 INFO L226 Difference]: Without dead ends: 218367 [2025-02-05 10:48:08,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 283 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:48:08,306 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 211 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:48:08,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 180 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:48:08,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218367 states. [2025-02-05 10:48:11,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218367 to 216693. [2025-02-05 10:48:11,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216693 states, 216692 states have (on average 1.1409096782530042) internal successors, (247226), 216692 states have internal predecessors, (247226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:48:11,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216693 states to 216693 states and 247226 transitions. [2025-02-05 10:48:11,577 INFO L78 Accepts]: Start accepts. Automaton has 216693 states and 247226 transitions. Word has length 284 [2025-02-05 10:48:11,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:48:11,578 INFO L471 AbstractCegarLoop]: Abstraction has 216693 states and 247226 transitions. [2025-02-05 10:48:11,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:48:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 216693 states and 247226 transitions. [2025-02-05 10:48:11,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-02-05 10:48:11,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:48:11,645 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:11,655 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:48:11,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:48:11,846 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:48:11,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:48:11,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1348647338, now seen corresponding path program 1 times [2025-02-05 10:48:11,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:48:11,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651563168] [2025-02-05 10:48:11,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:11,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:48:11,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-02-05 10:48:11,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-02-05 10:48:11,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:11,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:12,725 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-02-05 10:48:12,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:48:12,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651563168] [2025-02-05 10:48:12,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651563168] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:48:12,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403768902] [2025-02-05 10:48:12,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:12,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:48:12,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:48:12,728 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:48:12,729 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:48:12,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-02-05 10:48:12,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-02-05 10:48:12,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:12,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:12,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:48:12,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:48:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-02-05 10:48:12,919 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:48:12,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403768902] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:48:12,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:48:12,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-05 10:48:12,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814984613] [2025-02-05 10:48:12,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:48:12,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:48:12,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:48:12,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:48:12,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:48:12,920 INFO L87 Difference]: Start difference. First operand 216693 states and 247226 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 2 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:48:14,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:48:14,125 INFO L93 Difference]: Finished difference Result 407877 states and 466330 transitions. [2025-02-05 10:48:14,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:48:14,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 2 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 288 [2025-02-05 10:48:14,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:48:14,347 INFO L225 Difference]: With dead ends: 407877 [2025-02-05 10:48:14,347 INFO L226 Difference]: Without dead ends: 191186 [2025-02-05 10:48:14,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 287 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:48:14,461 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 308 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:48:14,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 31 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:48:14,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191186 states. [2025-02-05 10:48:16,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191186 to 189968. [2025-02-05 10:48:16,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189968 states, 189967 states have (on average 1.1368921970658061) internal successors, (215972), 189967 states have internal predecessors, (215972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:48:17,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189968 states to 189968 states and 215972 transitions. [2025-02-05 10:48:17,552 INFO L78 Accepts]: Start accepts. Automaton has 189968 states and 215972 transitions. Word has length 288 [2025-02-05 10:48:17,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:48:17,552 INFO L471 AbstractCegarLoop]: Abstraction has 189968 states and 215972 transitions. [2025-02-05 10:48:17,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 2 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:48:17,553 INFO L276 IsEmpty]: Start isEmpty. Operand 189968 states and 215972 transitions. [2025-02-05 10:48:17,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-02-05 10:48:17,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:48:17,598 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:17,605 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:48:17,803 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:48:17,803 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:48:17,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:48:17,803 INFO L85 PathProgramCache]: Analyzing trace with hash 705548147, now seen corresponding path program 1 times [2025-02-05 10:48:17,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:48:17,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857971888] [2025-02-05 10:48:17,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:17,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:48:17,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-02-05 10:48:17,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-02-05 10:48:17,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:17,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:18,808 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 10:48:18,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:48:18,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857971888] [2025-02-05 10:48:18,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857971888] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:48:18,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666454299] [2025-02-05 10:48:18,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:48:18,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:48:18,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:48:18,811 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:48:18,813 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:48:18,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-02-05 10:48:18,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-02-05 10:48:18,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:48:18,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:48:18,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:48:18,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:48:19,022 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:48:19,025 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:48:19,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666454299] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:48:19,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:48:19,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:48:19,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736790450] [2025-02-05 10:48:19,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:48:19,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:48:19,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:48:19,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:48:19,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:48:19,027 INFO L87 Difference]: Start difference. First operand 189968 states and 215972 transitions. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:48:20,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:48:20,409 INFO L93 Difference]: Finished difference Result 369533 states and 418819 transitions. [2025-02-05 10:48:20,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:48:20,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 300 [2025-02-05 10:48:20,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:48:20,638 INFO L225 Difference]: With dead ends: 369533 [2025-02-05 10:48:20,638 INFO L226 Difference]: Without dead ends: 179567 [2025-02-05 10:48:20,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 299 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:48:20,747 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 231 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:48:20,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 312 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]