./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label24.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/Problem14_label24.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 052d87c43f9a6a303e543fa72a6072828b82ea75a73030e4fb80f0f24076f245 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:49:18,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:49:18,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:49:18,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:49:18,645 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:49:18,664 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:49:18,665 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:49:18,665 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:49:18,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:49:18,665 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:49:18,666 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:49:18,666 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:49:18,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:49:18,666 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:49:18,666 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:49:18,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:49:18,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:49:18,666 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:49:18,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:49:18,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:49:18,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:49:18,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:49:18,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:49:18,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:49:18,667 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:49:18,667 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:49:18,667 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:49:18,667 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:49:18,667 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:49:18,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:49:18,668 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:49:18,668 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:49:18,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:49:18,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:49:18,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:49:18,668 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:49:18,668 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:49:18,668 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:49:18,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:49:18,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:49:18,668 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:49:18,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:49:18,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:49:18,669 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 -> 052d87c43f9a6a303e543fa72a6072828b82ea75a73030e4fb80f0f24076f245 [2025-02-05 11:49:18,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:49:18,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:49:18,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:49:18,926 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:49:18,926 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:49:18,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label24.c [2025-02-05 11:49:20,098 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b66af69f7/bb9561c6c4c2419bb5ea502f48f8dba2/FLAGce4e0312e [2025-02-05 11:49:20,402 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:49:20,406 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label24.c [2025-02-05 11:49:20,419 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b66af69f7/bb9561c6c4c2419bb5ea502f48f8dba2/FLAGce4e0312e [2025-02-05 11:49:20,436 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b66af69f7/bb9561c6c4c2419bb5ea502f48f8dba2 [2025-02-05 11:49:20,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:49:20,440 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:49:20,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:49:20,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:49:20,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:49:20,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:49:20" (1/1) ... [2025-02-05 11:49:20,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a471697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:20, skipping insertion in model container [2025-02-05 11:49:20,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:49:20" (1/1) ... [2025-02-05 11:49:20,478 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:49:20,620 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/Problem14_label24.c[4340,4353] [2025-02-05 11:49:20,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:49:20,755 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:49:20,775 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/Problem14_label24.c[4340,4353] [2025-02-05 11:49:20,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:49:20,848 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:49:20,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:20 WrapperNode [2025-02-05 11:49:20,850 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:49:20,851 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:49:20,851 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:49:20,851 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:49:20,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:20" (1/1) ... [2025-02-05 11:49:20,869 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:20" (1/1) ... [2025-02-05 11:49:20,909 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-02-05 11:49:20,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:49:20,910 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:49:20,910 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:49:20,910 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:49:20,920 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:20" (1/1) ... [2025-02-05 11:49:20,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:20" (1/1) ... [2025-02-05 11:49:20,927 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:20" (1/1) ... [2025-02-05 11:49:20,960 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 11:49:20,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:20" (1/1) ... [2025-02-05 11:49:20,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:20" (1/1) ... [2025-02-05 11:49:20,981 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:20" (1/1) ... [2025-02-05 11:49:20,984 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:20" (1/1) ... [2025-02-05 11:49:20,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:20" (1/1) ... [2025-02-05 11:49:20,994 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:20" (1/1) ... [2025-02-05 11:49:20,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:49:21,000 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:49:21,000 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:49:21,000 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:49:21,001 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:20" (1/1) ... [2025-02-05 11:49:21,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:49:21,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:49:21,028 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 11:49:21,033 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 11:49:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:49:21,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:49:21,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:49:21,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:49:21,091 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:49:21,093 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:49:22,221 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-02-05 11:49:22,222 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:49:22,233 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:49:22,234 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:49:22,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:49:22 BoogieIcfgContainer [2025-02-05 11:49:22,234 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:49:22,236 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:49:22,236 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:49:22,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:49:22,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:49:20" (1/3) ... [2025-02-05 11:49:22,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6356bd6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:49:22, skipping insertion in model container [2025-02-05 11:49:22,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:49:20" (2/3) ... [2025-02-05 11:49:22,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6356bd6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:49:22, skipping insertion in model container [2025-02-05 11:49:22,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:49:22" (3/3) ... [2025-02-05 11:49:22,243 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label24.c [2025-02-05 11:49:22,258 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:49:22,259 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label24.c that has 1 procedures, 245 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:49:22,313 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:49:22,324 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;@4dd981f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:49:22,324 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:49:22,328 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 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 11:49:22,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 11:49:22,335 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:22,336 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] [2025-02-05 11:49:22,337 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:22,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:22,341 INFO L85 PathProgramCache]: Analyzing trace with hash -746843201, now seen corresponding path program 1 times [2025-02-05 11:49:22,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:22,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461328377] [2025-02-05 11:49:22,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:22,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:22,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 11:49:22,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 11:49:22,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:22,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:22,628 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 11:49:22,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:22,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461328377] [2025-02-05 11:49:22,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461328377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:22,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:22,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:49:22,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799506284] [2025-02-05 11:49:22,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:22,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:22,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:22,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:22,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:22,654 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 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 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 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 11:49:23,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:23,410 INFO L93 Difference]: Finished difference Result 669 states and 1197 transitions. [2025-02-05 11:49:23,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:23,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 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 41 [2025-02-05 11:49:23,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:23,421 INFO L225 Difference]: With dead ends: 669 [2025-02-05 11:49:23,422 INFO L226 Difference]: Without dead ends: 360 [2025-02-05 11:49:23,427 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 11:49:23,429 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 165 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:23,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 77 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:49:23,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-02-05 11:49:23,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-02-05 11:49:23,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.6378830083565459) internal successors, (588), 359 states have internal predecessors, (588), 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 11:49:23,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 588 transitions. [2025-02-05 11:49:23,491 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 588 transitions. Word has length 41 [2025-02-05 11:49:23,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:23,491 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 588 transitions. [2025-02-05 11:49:23,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 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 11:49:23,492 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 588 transitions. [2025-02-05 11:49:23,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 11:49:23,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:23,497 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 11:49:23,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:49:23,498 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:23,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:23,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1761486069, now seen corresponding path program 1 times [2025-02-05 11:49:23,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:23,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366131874] [2025-02-05 11:49:23,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:23,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:23,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 11:49:23,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 11:49:23,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:23,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:49:23,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:23,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366131874] [2025-02-05 11:49:23,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366131874] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:23,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:23,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:49:23,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273431612] [2025-02-05 11:49:23,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:23,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:23,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:23,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:23,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:23,711 INFO L87 Difference]: Start difference. First operand 360 states and 588 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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 11:49:24,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:24,281 INFO L93 Difference]: Finished difference Result 1074 states and 1759 transitions. [2025-02-05 11:49:24,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:24,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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 106 [2025-02-05 11:49:24,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:24,288 INFO L225 Difference]: With dead ends: 1074 [2025-02-05 11:49:24,288 INFO L226 Difference]: Without dead ends: 716 [2025-02-05 11:49:24,290 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 11:49:24,291 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 132 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:24,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 89 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:49:24,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-02-05 11:49:24,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 538. [2025-02-05 11:49:24,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 1.4934823091247673) internal successors, (802), 537 states have internal predecessors, (802), 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 11:49:24,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 802 transitions. [2025-02-05 11:49:24,310 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 802 transitions. Word has length 106 [2025-02-05 11:49:24,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:24,310 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 802 transitions. [2025-02-05 11:49:24,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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 11:49:24,311 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 802 transitions. [2025-02-05 11:49:24,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 11:49:24,312 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:24,313 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 11:49:24,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:49:24,313 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:24,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:24,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1876993902, now seen corresponding path program 1 times [2025-02-05 11:49:24,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:24,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981935854] [2025-02-05 11:49:24,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:24,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:24,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 11:49:24,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 11:49:24,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:24,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:24,585 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:49:24,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:24,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981935854] [2025-02-05 11:49:24,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981935854] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:24,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:24,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:49:24,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277888176] [2025-02-05 11:49:24,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:24,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:49:24,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:24,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:49:24,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:49:24,588 INFO L87 Difference]: Start difference. First operand 538 states and 802 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 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 11:49:25,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:25,299 INFO L93 Difference]: Finished difference Result 1430 states and 2030 transitions. [2025-02-05 11:49:25,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:49:25,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 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 120 [2025-02-05 11:49:25,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:25,305 INFO L225 Difference]: With dead ends: 1430 [2025-02-05 11:49:25,305 INFO L226 Difference]: Without dead ends: 894 [2025-02-05 11:49:25,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:49:25,306 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 419 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:25,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 121 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:49:25,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2025-02-05 11:49:25,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2025-02-05 11:49:25,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.3370660694288914) internal successors, (1194), 893 states have internal predecessors, (1194), 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 11:49:25,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1194 transitions. [2025-02-05 11:49:25,323 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1194 transitions. Word has length 120 [2025-02-05 11:49:25,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:25,323 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1194 transitions. [2025-02-05 11:49:25,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 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 11:49:25,323 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1194 transitions. [2025-02-05 11:49:25,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-02-05 11:49:25,331 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:25,331 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:25,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:49:25,331 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:25,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:25,332 INFO L85 PathProgramCache]: Analyzing trace with hash -81095450, now seen corresponding path program 1 times [2025-02-05 11:49:25,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:25,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645118840] [2025-02-05 11:49:25,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:25,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:25,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-05 11:49:25,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-05 11:49:25,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:25,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:25,626 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 11:49:25,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:25,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645118840] [2025-02-05 11:49:25,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645118840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:25,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:25,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:49:25,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492353449] [2025-02-05 11:49:25,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:25,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:49:25,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:25,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:49:25,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:49:25,628 INFO L87 Difference]: Start difference. First operand 894 states and 1194 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 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 11:49:26,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:26,217 INFO L93 Difference]: Finished difference Result 1993 states and 2629 transitions. [2025-02-05 11:49:26,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:49:26,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 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 200 [2025-02-05 11:49:26,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:26,221 INFO L225 Difference]: With dead ends: 1993 [2025-02-05 11:49:26,221 INFO L226 Difference]: Without dead ends: 1072 [2025-02-05 11:49:26,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:49:26,223 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 116 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:26,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 119 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:49:26,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2025-02-05 11:49:26,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2025-02-05 11:49:26,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1071 states have (on average 1.1802054154995332) internal successors, (1264), 1071 states have internal predecessors, (1264), 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 11:49:26,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1264 transitions. [2025-02-05 11:49:26,241 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1264 transitions. Word has length 200 [2025-02-05 11:49:26,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:26,242 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1264 transitions. [2025-02-05 11:49:26,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 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 11:49:26,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1264 transitions. [2025-02-05 11:49:26,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-05 11:49:26,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:26,244 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:49:26,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:49:26,244 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:26,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:26,244 INFO L85 PathProgramCache]: Analyzing trace with hash 619937524, now seen corresponding path program 1 times [2025-02-05 11:49:26,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:26,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171950014] [2025-02-05 11:49:26,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:26,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:26,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 11:49:26,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 11:49:26,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:26,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:26,571 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 77 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:49:26,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:26,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171950014] [2025-02-05 11:49:26,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171950014] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:49:26,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452994043] [2025-02-05 11:49:26,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:26,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:26,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:49:26,576 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 11:49:26,577 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 11:49:26,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 11:49:26,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 11:49:26,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:26,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:26,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:49:26,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:49:26,763 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-02-05 11:49:26,763 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:49:26,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452994043] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:26,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:49:26,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 11:49:26,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447495772] [2025-02-05 11:49:26,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:26,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:26,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:26,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:26,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:49:26,765 INFO L87 Difference]: Start difference. First operand 1072 states and 1264 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 11:49:27,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:27,213 INFO L93 Difference]: Finished difference Result 2498 states and 3033 transitions. [2025-02-05 11:49:27,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:27,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 212 [2025-02-05 11:49:27,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:27,219 INFO L225 Difference]: With dead ends: 2498 [2025-02-05 11:49:27,219 INFO L226 Difference]: Without dead ends: 1428 [2025-02-05 11:49:27,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:49:27,222 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 142 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:27,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 85 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:49:27,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2025-02-05 11:49:27,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1072. [2025-02-05 11:49:27,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1071 states have (on average 1.1802054154995332) internal successors, (1264), 1071 states have internal predecessors, (1264), 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 11:49:27,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1264 transitions. [2025-02-05 11:49:27,242 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1264 transitions. Word has length 212 [2025-02-05 11:49:27,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:27,243 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1264 transitions. [2025-02-05 11:49:27,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 11:49:27,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1264 transitions. [2025-02-05 11:49:27,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 11:49:27,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:27,246 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:49:27,255 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 11:49:27,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:27,448 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:27,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:27,448 INFO L85 PathProgramCache]: Analyzing trace with hash 47189477, now seen corresponding path program 1 times [2025-02-05 11:49:27,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:27,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715166833] [2025-02-05 11:49:27,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:27,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:27,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 11:49:27,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 11:49:27,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:27,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:27,643 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:49:27,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:27,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715166833] [2025-02-05 11:49:27,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715166833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:27,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:27,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:49:27,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440567366] [2025-02-05 11:49:27,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:27,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:27,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:27,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:27,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:27,644 INFO L87 Difference]: Start difference. First operand 1072 states and 1264 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 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 11:49:28,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:28,069 INFO L93 Difference]: Finished difference Result 2676 states and 3213 transitions. [2025-02-05 11:49:28,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:28,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 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 11:49:28,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:28,075 INFO L225 Difference]: With dead ends: 2676 [2025-02-05 11:49:28,075 INFO L226 Difference]: Without dead ends: 1606 [2025-02-05 11:49:28,076 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 11:49:28,077 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 111 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:28,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 58 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:49:28,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2025-02-05 11:49:28,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1428. [2025-02-05 11:49:28,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1427 states have (on average 1.156271899088998) internal successors, (1650), 1427 states have internal predecessors, (1650), 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 11:49:28,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1650 transitions. [2025-02-05 11:49:28,099 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1650 transitions. Word has length 215 [2025-02-05 11:49:28,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:28,100 INFO L471 AbstractCegarLoop]: Abstraction has 1428 states and 1650 transitions. [2025-02-05 11:49:28,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 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 11:49:28,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1650 transitions. [2025-02-05 11:49:28,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-02-05 11:49:28,102 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:28,103 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:28,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:49:28,104 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:28,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:28,104 INFO L85 PathProgramCache]: Analyzing trace with hash 2034309907, now seen corresponding path program 1 times [2025-02-05 11:49:28,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:28,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531892512] [2025-02-05 11:49:28,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:28,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:28,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-02-05 11:49:28,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-02-05 11:49:28,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:28,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:28,474 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 171 proven. 130 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 11:49:28,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:28,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531892512] [2025-02-05 11:49:28,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531892512] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:49:28,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927585469] [2025-02-05 11:49:28,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:28,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:28,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:49:28,477 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 11:49:28,479 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 11:49:28,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-02-05 11:49:28,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-02-05 11:49:28,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:28,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:28,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:49:28,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:49:28,912 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2025-02-05 11:49:28,914 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:49:28,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927585469] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:28,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:49:28,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-05 11:49:28,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137524742] [2025-02-05 11:49:28,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:28,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:28,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:28,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:28,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:49:28,916 INFO L87 Difference]: Start difference. First operand 1428 states and 1650 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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 11:49:29,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:29,384 INFO L93 Difference]: Finished difference Result 3210 states and 3788 transitions. [2025-02-05 11:49:29,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:29,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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 334 [2025-02-05 11:49:29,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:29,390 INFO L225 Difference]: With dead ends: 3210 [2025-02-05 11:49:29,390 INFO L226 Difference]: Without dead ends: 1962 [2025-02-05 11:49:29,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:49:29,392 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 82 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:29,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 47 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:49:29,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2025-02-05 11:49:29,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2025-02-05 11:49:29,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 1.1402131239484015) internal successors, (2033), 1783 states have internal predecessors, (2033), 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 11:49:29,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2033 transitions. [2025-02-05 11:49:29,419 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2033 transitions. Word has length 334 [2025-02-05 11:49:29,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:29,419 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2033 transitions. [2025-02-05 11:49:29,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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 11:49:29,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2033 transitions. [2025-02-05 11:49:29,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2025-02-05 11:49:29,427 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:29,427 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:29,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 11:49:29,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:29,628 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:29,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:29,629 INFO L85 PathProgramCache]: Analyzing trace with hash 912437919, now seen corresponding path program 1 times [2025-02-05 11:49:29,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:29,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584678865] [2025-02-05 11:49:29,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:29,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:29,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-02-05 11:49:29,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-02-05 11:49:29,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:29,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:29,906 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2025-02-05 11:49:29,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:29,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584678865] [2025-02-05 11:49:29,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584678865] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:29,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:29,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:49:29,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56146301] [2025-02-05 11:49:29,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:29,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:49:29,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:29,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:49:29,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:49:29,910 INFO L87 Difference]: Start difference. First operand 1784 states and 2033 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 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 11:49:30,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:30,404 INFO L93 Difference]: Finished difference Result 3595 states and 4116 transitions. [2025-02-05 11:49:30,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:49:30,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 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 411 [2025-02-05 11:49:30,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:30,410 INFO L225 Difference]: With dead ends: 3595 [2025-02-05 11:49:30,410 INFO L226 Difference]: Without dead ends: 1962 [2025-02-05 11:49:30,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:49:30,412 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 141 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:30,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 17 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:49:30,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2025-02-05 11:49:30,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2025-02-05 11:49:30,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 1.089736399326977) internal successors, (1943), 1783 states have internal predecessors, (1943), 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 11:49:30,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 1943 transitions. [2025-02-05 11:49:30,437 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 1943 transitions. Word has length 411 [2025-02-05 11:49:30,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:30,438 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 1943 transitions. [2025-02-05 11:49:30,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 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 11:49:30,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 1943 transitions. [2025-02-05 11:49:30,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-02-05 11:49:30,442 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:30,442 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:30,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:49:30,442 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:30,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:30,443 INFO L85 PathProgramCache]: Analyzing trace with hash -624329352, now seen corresponding path program 1 times [2025-02-05 11:49:30,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:30,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955980459] [2025-02-05 11:49:30,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:30,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:30,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-02-05 11:49:30,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-02-05 11:49:30,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:30,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:30,742 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 361 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-02-05 11:49:30,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:30,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955980459] [2025-02-05 11:49:30,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955980459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:30,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:30,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:49:30,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579781786] [2025-02-05 11:49:30,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:30,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:30,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:30,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:30,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:30,744 INFO L87 Difference]: Start difference. First operand 1784 states and 1943 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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 11:49:31,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:31,154 INFO L93 Difference]: Finished difference Result 4278 states and 4715 transitions. [2025-02-05 11:49:31,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:31,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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 434 [2025-02-05 11:49:31,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:31,161 INFO L225 Difference]: With dead ends: 4278 [2025-02-05 11:49:31,161 INFO L226 Difference]: Without dead ends: 2674 [2025-02-05 11:49:31,163 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 11:49:31,164 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 113 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:31,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 220 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:49:31,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2025-02-05 11:49:31,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2318. [2025-02-05 11:49:31,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 2317 states have (on average 1.0854553301683212) internal successors, (2515), 2317 states have internal predecessors, (2515), 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 11:49:31,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2515 transitions. [2025-02-05 11:49:31,196 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2515 transitions. Word has length 434 [2025-02-05 11:49:31,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:31,196 INFO L471 AbstractCegarLoop]: Abstraction has 2318 states and 2515 transitions. [2025-02-05 11:49:31,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 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 11:49:31,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2515 transitions. [2025-02-05 11:49:31,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-02-05 11:49:31,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:31,201 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:31,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:49:31,201 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:31,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:31,201 INFO L85 PathProgramCache]: Analyzing trace with hash -890570402, now seen corresponding path program 1 times [2025-02-05 11:49:31,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:31,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058599409] [2025-02-05 11:49:31,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:31,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:31,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-02-05 11:49:31,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-02-05 11:49:31,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:31,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:31,671 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 405 proven. 195 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-02-05 11:49:31,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:31,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058599409] [2025-02-05 11:49:31,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058599409] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:49:31,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176156377] [2025-02-05 11:49:31,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:31,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:31,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:49:31,676 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 11:49:31,678 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 11:49:31,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-02-05 11:49:31,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-02-05 11:49:31,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:31,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:31,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:49:31,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:49:31,849 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-02-05 11:49:31,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:49:31,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176156377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:31,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:49:31,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 11:49:31,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906316303] [2025-02-05 11:49:31,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:31,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:31,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:31,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:31,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:49:31,851 INFO L87 Difference]: Start difference. First operand 2318 states and 2515 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 11:49:32,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:32,256 INFO L93 Difference]: Finished difference Result 5346 states and 5860 transitions. [2025-02-05 11:49:32,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:32,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 437 [2025-02-05 11:49:32,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:32,266 INFO L225 Difference]: With dead ends: 5346 [2025-02-05 11:49:32,266 INFO L226 Difference]: Without dead ends: 3208 [2025-02-05 11:49:32,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:49:32,269 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 140 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:32,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 234 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:49:32,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2025-02-05 11:49:32,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 2852. [2025-02-05 11:49:32,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2851 states have (on average 1.0862855138547878) internal successors, (3097), 2851 states have internal predecessors, (3097), 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 11:49:32,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3097 transitions. [2025-02-05 11:49:32,309 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3097 transitions. Word has length 437 [2025-02-05 11:49:32,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:32,310 INFO L471 AbstractCegarLoop]: Abstraction has 2852 states and 3097 transitions. [2025-02-05 11:49:32,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 11:49:32,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3097 transitions. [2025-02-05 11:49:32,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-02-05 11:49:32,314 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:32,314 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:32,322 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 11:49:32,514 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 11:49:32,515 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:32,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:32,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1308798972, now seen corresponding path program 1 times [2025-02-05 11:49:32,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:32,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470703630] [2025-02-05 11:49:32,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:32,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:32,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-02-05 11:49:32,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-02-05 11:49:32,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:32,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:32,931 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 259 proven. 195 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2025-02-05 11:49:32,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:32,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470703630] [2025-02-05 11:49:32,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470703630] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:49:32,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534561981] [2025-02-05 11:49:32,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:32,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:32,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:49:32,933 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 11:49:32,935 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 11:49:32,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-02-05 11:49:33,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-02-05 11:49:33,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:33,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:33,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:49:33,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:49:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2025-02-05 11:49:33,097 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:49:33,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534561981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:33,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:49:33,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 11:49:33,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371795939] [2025-02-05 11:49:33,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:33,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:33,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:33,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:33,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:49:33,098 INFO L87 Difference]: Start difference. First operand 2852 states and 3097 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 11:49:33,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:33,483 INFO L93 Difference]: Finished difference Result 3744 states and 4040 transitions. [2025-02-05 11:49:33,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:33,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 449 [2025-02-05 11:49:33,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:33,492 INFO L225 Difference]: With dead ends: 3744 [2025-02-05 11:49:33,492 INFO L226 Difference]: Without dead ends: 3742 [2025-02-05 11:49:33,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:49:33,494 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 161 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:33,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 11 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:49:33,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2025-02-05 11:49:33,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 2852. [2025-02-05 11:49:33,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2851 states have (on average 1.0862855138547878) internal successors, (3097), 2851 states have internal predecessors, (3097), 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 11:49:33,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3097 transitions. [2025-02-05 11:49:33,533 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3097 transitions. Word has length 449 [2025-02-05 11:49:33,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:33,534 INFO L471 AbstractCegarLoop]: Abstraction has 2852 states and 3097 transitions. [2025-02-05 11:49:33,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 11:49:33,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3097 transitions. [2025-02-05 11:49:33,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-02-05 11:49:33,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:33,539 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:33,547 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 11:49:33,740 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 11:49:33,740 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:33,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:33,741 INFO L85 PathProgramCache]: Analyzing trace with hash -873904145, now seen corresponding path program 1 times [2025-02-05 11:49:33,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:33,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086214085] [2025-02-05 11:49:33,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:33,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:33,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-02-05 11:49:33,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-02-05 11:49:33,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:33,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:33,902 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 475 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-02-05 11:49:33,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:33,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086214085] [2025-02-05 11:49:33,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086214085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:33,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:33,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:49:33,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979568798] [2025-02-05 11:49:33,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:33,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:33,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:33,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:33,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:33,904 INFO L87 Difference]: Start difference. First operand 2852 states and 3097 transitions. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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 11:49:34,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:34,330 INFO L93 Difference]: Finished difference Result 6770 states and 7417 transitions. [2025-02-05 11:49:34,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:34,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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 475 [2025-02-05 11:49:34,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:34,340 INFO L225 Difference]: With dead ends: 6770 [2025-02-05 11:49:34,341 INFO L226 Difference]: Without dead ends: 4098 [2025-02-05 11:49:34,344 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 11:49:34,345 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 74 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:34,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 50 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:49:34,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2025-02-05 11:49:34,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 4098. [2025-02-05 11:49:34,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.0829875518672198) internal successors, (4437), 4097 states have internal predecessors, (4437), 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 11:49:34,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4437 transitions. [2025-02-05 11:49:34,429 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4437 transitions. Word has length 475 [2025-02-05 11:49:34,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:34,430 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 4437 transitions. [2025-02-05 11:49:34,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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 11:49:34,431 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4437 transitions. [2025-02-05 11:49:34,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-02-05 11:49:34,438 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:34,438 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:34,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:49:34,439 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:34,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:34,439 INFO L85 PathProgramCache]: Analyzing trace with hash 145760342, now seen corresponding path program 1 times [2025-02-05 11:49:34,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:34,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500625614] [2025-02-05 11:49:34,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:34,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:34,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-02-05 11:49:34,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-02-05 11:49:34,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:34,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:34,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 680 proven. 195 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-05 11:49:34,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:34,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500625614] [2025-02-05 11:49:34,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500625614] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:49:34,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34974902] [2025-02-05 11:49:34,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:34,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:34,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:49:34,994 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 11:49:34,995 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 11:49:35,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-02-05 11:49:35,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-02-05 11:49:35,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:35,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:35,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:49:35,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:49:35,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2025-02-05 11:49:35,191 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:49:35,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34974902] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:35,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:49:35,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 11:49:35,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065612993] [2025-02-05 11:49:35,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:35,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:35,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:35,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:35,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:49:35,193 INFO L87 Difference]: Start difference. First operand 4098 states and 4437 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 11:49:35,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:35,578 INFO L93 Difference]: Finished difference Result 9084 states and 9825 transitions. [2025-02-05 11:49:35,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:35,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 506 [2025-02-05 11:49:35,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:35,592 INFO L225 Difference]: With dead ends: 9084 [2025-02-05 11:49:35,592 INFO L226 Difference]: Without dead ends: 4632 [2025-02-05 11:49:35,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:49:35,599 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 140 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:35,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 247 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:49:35,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2025-02-05 11:49:35,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 3920. [2025-02-05 11:49:35,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3920 states, 3919 states have (on average 1.076039806072978) internal successors, (4217), 3919 states have internal predecessors, (4217), 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 11:49:35,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4217 transitions. [2025-02-05 11:49:35,656 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4217 transitions. Word has length 506 [2025-02-05 11:49:35,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:35,656 INFO L471 AbstractCegarLoop]: Abstraction has 3920 states and 4217 transitions. [2025-02-05 11:49:35,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 11:49:35,656 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4217 transitions. [2025-02-05 11:49:35,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-02-05 11:49:35,660 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:35,660 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:35,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 11:49:35,860 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,SelfDestructingSolverStorable12 [2025-02-05 11:49:35,861 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:35,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:35,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1022088788, now seen corresponding path program 1 times [2025-02-05 11:49:35,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:35,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821440780] [2025-02-05 11:49:35,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:35,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:35,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-02-05 11:49:35,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-02-05 11:49:35,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:35,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:36,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 739 proven. 11 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2025-02-05 11:49:36,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:36,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821440780] [2025-02-05 11:49:36,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821440780] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:49:36,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751059968] [2025-02-05 11:49:36,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:36,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:36,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:49:36,163 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 11:49:36,163 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 11:49:36,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-02-05 11:49:36,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-02-05 11:49:36,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:36,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:36,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 11:49:36,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:49:37,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 750 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2025-02-05 11:49:37,801 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:49:37,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751059968] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:37,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:49:37,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-02-05 11:49:37,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649922300] [2025-02-05 11:49:37,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:37,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 11:49:37,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:37,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 11:49:37,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 11:49:37,804 INFO L87 Difference]: Start difference. First operand 3920 states and 4217 transitions. Second operand has 5 states, 5 states have (on average 58.0) internal successors, (290), 4 states have internal predecessors, (290), 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 11:49:38,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:38,368 INFO L93 Difference]: Finished difference Result 7838 states and 8436 transitions. [2025-02-05 11:49:38,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:49:38,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 58.0) internal successors, (290), 4 states have internal predecessors, (290), 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 536 [2025-02-05 11:49:38,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:38,380 INFO L225 Difference]: With dead ends: 7838 [2025-02-05 11:49:38,380 INFO L226 Difference]: Without dead ends: 3920 [2025-02-05 11:49:38,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 533 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 11:49:38,385 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 254 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:38,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 49 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:49:38,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2025-02-05 11:49:38,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3564. [2025-02-05 11:49:38,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3564 states, 3563 states have (on average 1.0550098231827112) internal successors, (3759), 3563 states have internal predecessors, (3759), 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 11:49:38,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3759 transitions. [2025-02-05 11:49:38,436 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3759 transitions. Word has length 536 [2025-02-05 11:49:38,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:38,437 INFO L471 AbstractCegarLoop]: Abstraction has 3564 states and 3759 transitions. [2025-02-05 11:49:38,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.0) internal successors, (290), 4 states have internal predecessors, (290), 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 11:49:38,437 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3759 transitions. [2025-02-05 11:49:38,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 766 [2025-02-05 11:49:38,442 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:38,442 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 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 11:49:38,449 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 11:49:38,642 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,SelfDestructingSolverStorable13 [2025-02-05 11:49:38,643 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:38,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:38,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1604915805, now seen corresponding path program 1 times [2025-02-05 11:49:38,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:38,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096915177] [2025-02-05 11:49:38,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:38,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:38,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 765 statements into 1 equivalence classes. [2025-02-05 11:49:38,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 765 of 765 statements. [2025-02-05 11:49:38,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:38,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:38,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1697 backedges. 1189 proven. 155 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2025-02-05 11:49:38,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:38,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096915177] [2025-02-05 11:49:38,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096915177] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:49:38,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558729919] [2025-02-05 11:49:38,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:38,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:38,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:49:38,936 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 11:49:38,937 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 11:49:39,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 765 statements into 1 equivalence classes. [2025-02-05 11:49:39,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 765 of 765 statements. [2025-02-05 11:49:39,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:39,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:39,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:49:39,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:49:39,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1697 backedges. 1189 proven. 155 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2025-02-05 11:49:39,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:49:39,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1697 backedges. 1189 proven. 155 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2025-02-05 11:49:39,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558729919] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:49:39,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:49:39,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-05 11:49:39,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751123687] [2025-02-05 11:49:39,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:49:39,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 11:49:39,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:39,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 11:49:39,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:49:39,641 INFO L87 Difference]: Start difference. First operand 3564 states and 3759 transitions. Second operand has 6 states, 6 states have (on average 141.66666666666666) internal successors, (850), 6 states have internal predecessors, (850), 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 11:49:40,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:40,307 INFO L93 Difference]: Finished difference Result 8194 states and 8674 transitions. [2025-02-05 11:49:40,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 11:49:40,308 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 141.66666666666666) internal successors, (850), 6 states have internal predecessors, (850), 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 765 [2025-02-05 11:49:40,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:40,315 INFO L225 Difference]: With dead ends: 8194 [2025-02-05 11:49:40,315 INFO L226 Difference]: Without dead ends: 4810 [2025-02-05 11:49:40,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1532 GetRequests, 1528 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:49:40,318 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 38 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:40,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 53 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:49:40,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2025-02-05 11:49:40,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4276. [2025-02-05 11:49:40,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4275 states have (on average 1.0589473684210526) internal successors, (4527), 4275 states have internal predecessors, (4527), 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 11:49:40,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4527 transitions. [2025-02-05 11:49:40,361 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4527 transitions. Word has length 765 [2025-02-05 11:49:40,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:40,362 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 4527 transitions. [2025-02-05 11:49:40,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 141.66666666666666) internal successors, (850), 6 states have internal predecessors, (850), 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 11:49:40,362 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4527 transitions. [2025-02-05 11:49:40,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 838 [2025-02-05 11:49:40,367 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:40,367 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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 11:49:40,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 11:49:40,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:40,568 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:40,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:40,568 INFO L85 PathProgramCache]: Analyzing trace with hash -779785751, now seen corresponding path program 1 times [2025-02-05 11:49:40,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:40,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244496960] [2025-02-05 11:49:40,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:40,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:40,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 837 statements into 1 equivalence classes. [2025-02-05 11:49:40,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 837 of 837 statements. [2025-02-05 11:49:40,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:40,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:40,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2165 backedges. 1380 proven. 0 refuted. 0 times theorem prover too weak. 785 trivial. 0 not checked. [2025-02-05 11:49:40,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:40,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244496960] [2025-02-05 11:49:40,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244496960] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:40,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:40,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:49:40,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861176292] [2025-02-05 11:49:40,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:40,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:40,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:40,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:40,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:40,818 INFO L87 Difference]: Start difference. First operand 4276 states and 4527 transitions. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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 11:49:41,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:41,152 INFO L93 Difference]: Finished difference Result 8372 states and 8873 transitions. [2025-02-05 11:49:41,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:41,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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 837 [2025-02-05 11:49:41,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:41,159 INFO L225 Difference]: With dead ends: 8372 [2025-02-05 11:49:41,159 INFO L226 Difference]: Without dead ends: 4276 [2025-02-05 11:49:41,162 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 11:49:41,163 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 110 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:41,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 25 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 11:49:41,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2025-02-05 11:49:41,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4276. [2025-02-05 11:49:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4275 states have (on average 1.0498245614035089) internal successors, (4488), 4275 states have internal predecessors, (4488), 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 11:49:41,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4488 transitions. [2025-02-05 11:49:41,202 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4488 transitions. Word has length 837 [2025-02-05 11:49:41,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:41,203 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 4488 transitions. [2025-02-05 11:49:41,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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 11:49:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4488 transitions. [2025-02-05 11:49:41,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 933 [2025-02-05 11:49:41,208 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:41,209 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:41,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 11:49:41,209 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:41,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:41,210 INFO L85 PathProgramCache]: Analyzing trace with hash -384808340, now seen corresponding path program 1 times [2025-02-05 11:49:41,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:41,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880435927] [2025-02-05 11:49:41,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:41,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:41,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 932 statements into 1 equivalence classes. [2025-02-05 11:49:41,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 932 of 932 statements. [2025-02-05 11:49:41,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:41,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:41,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2748 backedges. 800 proven. 0 refuted. 0 times theorem prover too weak. 1948 trivial. 0 not checked. [2025-02-05 11:49:41,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:41,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880435927] [2025-02-05 11:49:41,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880435927] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:41,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:41,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:49:41,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283358314] [2025-02-05 11:49:41,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:41,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:41,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:41,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:41,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:41,734 INFO L87 Difference]: Start difference. First operand 4276 states and 4488 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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 11:49:41,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:41,996 INFO L93 Difference]: Finished difference Result 8906 states and 9375 transitions. [2025-02-05 11:49:41,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:41,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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 932 [2025-02-05 11:49:41,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:42,003 INFO L225 Difference]: With dead ends: 8906 [2025-02-05 11:49:42,003 INFO L226 Difference]: Without dead ends: 4810 [2025-02-05 11:49:42,006 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 11:49:42,007 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 109 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:42,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 219 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 11:49:42,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2025-02-05 11:49:42,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4632. [2025-02-05 11:49:42,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4632 states, 4631 states have (on average 1.044050960915569) internal successors, (4835), 4631 states have internal predecessors, (4835), 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 11:49:42,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4835 transitions. [2025-02-05 11:49:42,044 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4835 transitions. Word has length 932 [2025-02-05 11:49:42,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:42,044 INFO L471 AbstractCegarLoop]: Abstraction has 4632 states and 4835 transitions. [2025-02-05 11:49:42,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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 11:49:42,044 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4835 transitions. [2025-02-05 11:49:42,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1008 [2025-02-05 11:49:42,051 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:42,051 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:42,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 11:49:42,051 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:42,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:42,052 INFO L85 PathProgramCache]: Analyzing trace with hash -2087074731, now seen corresponding path program 1 times [2025-02-05 11:49:42,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:42,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148473139] [2025-02-05 11:49:42,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:42,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:42,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1007 statements into 1 equivalence classes. [2025-02-05 11:49:42,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1007 of 1007 statements. [2025-02-05 11:49:42,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:42,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:42,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3378 backedges. 909 proven. 0 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked. [2025-02-05 11:49:42,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:42,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148473139] [2025-02-05 11:49:42,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148473139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:42,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:42,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:49:42,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168531279] [2025-02-05 11:49:42,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:42,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:42,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:42,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:42,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:42,676 INFO L87 Difference]: Start difference. First operand 4632 states and 4835 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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 11:49:42,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:42,972 INFO L93 Difference]: Finished difference Result 9084 states and 9489 transitions. [2025-02-05 11:49:42,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:42,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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 1007 [2025-02-05 11:49:42,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:42,979 INFO L225 Difference]: With dead ends: 9084 [2025-02-05 11:49:42,979 INFO L226 Difference]: Without dead ends: 4632 [2025-02-05 11:49:42,982 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 11:49:42,983 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 111 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:42,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 227 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 11:49:42,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2025-02-05 11:49:43,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4632. [2025-02-05 11:49:43,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4632 states, 4631 states have (on average 1.0401641114230187) internal successors, (4817), 4631 states have internal predecessors, (4817), 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 11:49:43,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4817 transitions. [2025-02-05 11:49:43,023 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4817 transitions. Word has length 1007 [2025-02-05 11:49:43,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:43,024 INFO L471 AbstractCegarLoop]: Abstraction has 4632 states and 4817 transitions. [2025-02-05 11:49:43,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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 11:49:43,024 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4817 transitions. [2025-02-05 11:49:43,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1056 [2025-02-05 11:49:43,031 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:43,032 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:43,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 11:49:43,032 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:43,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:43,033 INFO L85 PathProgramCache]: Analyzing trace with hash -392455987, now seen corresponding path program 1 times [2025-02-05 11:49:43,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:43,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359101744] [2025-02-05 11:49:43,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:43,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:43,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1055 statements into 1 equivalence classes. [2025-02-05 11:49:43,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1055 of 1055 statements. [2025-02-05 11:49:43,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:43,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:43,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3575 backedges. 2520 proven. 72 refuted. 0 times theorem prover too weak. 983 trivial. 0 not checked. [2025-02-05 11:49:43,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:43,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359101744] [2025-02-05 11:49:43,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359101744] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:49:43,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416891554] [2025-02-05 11:49:43,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:43,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:43,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:49:43,944 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 11:49:43,945 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 11:49:44,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1055 statements into 1 equivalence classes. [2025-02-05 11:49:44,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1055 of 1055 statements. [2025-02-05 11:49:44,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:44,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:44,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 1300 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 11:49:44,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:49:44,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3575 backedges. 2479 proven. 666 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2025-02-05 11:49:44,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:49:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3575 backedges. 2592 proven. 0 refuted. 0 times theorem prover too weak. 983 trivial. 0 not checked. [2025-02-05 11:49:45,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416891554] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 11:49:45,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 11:49:45,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 9 [2025-02-05 11:49:45,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394135338] [2025-02-05 11:49:45,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:45,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 11:49:45,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:45,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 11:49:45,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:49:45,185 INFO L87 Difference]: Start difference. First operand 4632 states and 4817 transitions. Second operand has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 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 11:49:45,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:45,563 INFO L93 Difference]: Finished difference Result 9618 states and 10010 transitions. [2025-02-05 11:49:45,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:49:45,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 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 1055 [2025-02-05 11:49:45,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:45,570 INFO L225 Difference]: With dead ends: 9618 [2025-02-05 11:49:45,570 INFO L226 Difference]: Without dead ends: 5166 [2025-02-05 11:49:45,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2113 GetRequests, 2105 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:49:45,574 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 96 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:45,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 9 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:49:45,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2025-02-05 11:49:45,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4632. [2025-02-05 11:49:45,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4632 states, 4631 states have (on average 1.03973223925718) internal successors, (4815), 4631 states have internal predecessors, (4815), 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 11:49:45,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4815 transitions. [2025-02-05 11:49:45,644 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4815 transitions. Word has length 1055 [2025-02-05 11:49:45,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:45,644 INFO L471 AbstractCegarLoop]: Abstraction has 4632 states and 4815 transitions. [2025-02-05 11:49:45,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 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 11:49:45,645 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4815 transitions. [2025-02-05 11:49:45,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1215 [2025-02-05 11:49:45,662 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:45,662 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:45,670 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 11:49:45,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:45,863 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:45,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:45,864 INFO L85 PathProgramCache]: Analyzing trace with hash -187465139, now seen corresponding path program 1 times [2025-02-05 11:49:45,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:45,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875646530] [2025-02-05 11:49:45,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:45,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:45,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1214 statements into 1 equivalence classes. [2025-02-05 11:49:46,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1214 of 1214 statements. [2025-02-05 11:49:46,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:46,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:47,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4111 backedges. 3056 proven. 72 refuted. 0 times theorem prover too weak. 983 trivial. 0 not checked. [2025-02-05 11:49:47,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:47,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875646530] [2025-02-05 11:49:47,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875646530] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:49:47,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72575943] [2025-02-05 11:49:47,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:47,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:47,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:49:47,039 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 11:49:47,041 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 11:49:47,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1214 statements into 1 equivalence classes. [2025-02-05 11:49:47,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1214 of 1214 statements. [2025-02-05 11:49:47,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:47,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:47,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 1460 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 11:49:47,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:49:47,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4111 backedges. 2965 proven. 716 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2025-02-05 11:49:47,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:49:48,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4111 backedges. 3128 proven. 0 refuted. 0 times theorem prover too weak. 983 trivial. 0 not checked. [2025-02-05 11:49:48,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72575943] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 11:49:48,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 11:49:48,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 9 [2025-02-05 11:49:48,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953627164] [2025-02-05 11:49:48,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:48,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 11:49:48,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:48,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 11:49:48,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:49:48,221 INFO L87 Difference]: Start difference. First operand 4632 states and 4815 transitions. Second operand has 5 states, 5 states have (on average 156.0) internal successors, (780), 5 states have internal predecessors, (780), 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 11:49:48,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:48,578 INFO L93 Difference]: Finished difference Result 9618 states and 9992 transitions. [2025-02-05 11:49:48,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:49:48,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 156.0) internal successors, (780), 5 states have internal predecessors, (780), 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 1214 [2025-02-05 11:49:48,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:48,588 INFO L225 Difference]: With dead ends: 9618 [2025-02-05 11:49:48,588 INFO L226 Difference]: Without dead ends: 5166 [2025-02-05 11:49:48,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2431 GetRequests, 2424 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:49:48,592 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 54 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:48,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 10 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 11:49:48,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2025-02-05 11:49:48,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4988. [2025-02-05 11:49:48,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4988 states, 4987 states have (on average 1.0376980148385804) internal successors, (5175), 4987 states have internal predecessors, (5175), 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 11:49:48,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5175 transitions. [2025-02-05 11:49:48,666 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5175 transitions. Word has length 1214 [2025-02-05 11:49:48,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:48,667 INFO L471 AbstractCegarLoop]: Abstraction has 4988 states and 5175 transitions. [2025-02-05 11:49:48,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 156.0) internal successors, (780), 5 states have internal predecessors, (780), 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 11:49:48,667 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5175 transitions. [2025-02-05 11:49:48,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1296 [2025-02-05 11:49:48,677 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:48,678 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:48,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-05 11:49:48,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:48,882 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:48,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:48,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1696810933, now seen corresponding path program 1 times [2025-02-05 11:49:48,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:48,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940464921] [2025-02-05 11:49:48,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:48,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:48,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1295 statements into 1 equivalence classes. [2025-02-05 11:49:48,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1295 of 1295 statements. [2025-02-05 11:49:48,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:48,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:49,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5568 backedges. 2772 proven. 0 refuted. 0 times theorem prover too weak. 2796 trivial. 0 not checked. [2025-02-05 11:49:49,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:49,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940464921] [2025-02-05 11:49:49,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940464921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:49:49,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:49:49,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:49:49,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657926254] [2025-02-05 11:49:49,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:49:49,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:49:49,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:49,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:49:49,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:49:49,543 INFO L87 Difference]: Start difference. First operand 4988 states and 5175 transitions. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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 11:49:49,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:49,828 INFO L93 Difference]: Finished difference Result 10152 states and 10527 transitions. [2025-02-05 11:49:49,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:49:49,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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 1295 [2025-02-05 11:49:49,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:49,832 INFO L225 Difference]: With dead ends: 10152 [2025-02-05 11:49:49,832 INFO L226 Difference]: Without dead ends: 5166 [2025-02-05 11:49:49,836 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 11:49:49,836 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 53 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:49,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 229 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 11:49:49,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2025-02-05 11:49:49,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4988. [2025-02-05 11:49:49,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4988 states, 4987 states have (on average 1.0364948867054342) internal successors, (5169), 4987 states have internal predecessors, (5169), 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 11:49:49,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5169 transitions. [2025-02-05 11:49:49,877 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5169 transitions. Word has length 1295 [2025-02-05 11:49:49,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:49,878 INFO L471 AbstractCegarLoop]: Abstraction has 4988 states and 5169 transitions. [2025-02-05 11:49:49,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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 11:49:49,878 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5169 transitions. [2025-02-05 11:49:49,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1465 [2025-02-05 11:49:49,889 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:49:49,889 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:49:49,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 11:49:49,889 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:49:49,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:49:49,890 INFO L85 PathProgramCache]: Analyzing trace with hash -104936098, now seen corresponding path program 1 times [2025-02-05 11:49:49,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:49:49,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42838849] [2025-02-05 11:49:49,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:49,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:49:49,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1464 statements into 1 equivalence classes. [2025-02-05 11:49:50,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1464 of 1464 statements. [2025-02-05 11:49:50,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:50,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6247 backedges. 2663 proven. 78 refuted. 0 times theorem prover too weak. 3506 trivial. 0 not checked. [2025-02-05 11:49:51,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:49:51,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42838849] [2025-02-05 11:49:51,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42838849] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:49:51,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927862856] [2025-02-05 11:49:51,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:49:51,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:51,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:49:51,430 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:49:51,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 11:49:51,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1464 statements into 1 equivalence classes. [2025-02-05 11:49:51,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1464 of 1464 statements. [2025-02-05 11:49:51,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:49:51,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:49:51,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 1749 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 11:49:51,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:49:52,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6247 backedges. 1632 proven. 39 refuted. 0 times theorem prover too weak. 4576 trivial. 0 not checked. [2025-02-05 11:49:52,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:49:52,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6247 backedges. 1632 proven. 39 refuted. 0 times theorem prover too weak. 4576 trivial. 0 not checked. [2025-02-05 11:49:52,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927862856] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:49:52,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:49:52,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2025-02-05 11:49:52,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683812944] [2025-02-05 11:49:52,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:49:52,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 11:49:52,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:49:52,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 11:49:52,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 11:49:52,945 INFO L87 Difference]: Start difference. First operand 4988 states and 5169 transitions. Second operand has 8 states, 8 states have (on average 121.25) internal successors, (970), 8 states have internal predecessors, (970), 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 11:49:54,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:49:54,427 INFO L93 Difference]: Finished difference Result 13354 states and 13854 transitions. [2025-02-05 11:49:54,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 11:49:54,430 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 121.25) internal successors, (970), 8 states have internal predecessors, (970), 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 1464 [2025-02-05 11:49:54,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:49:54,431 INFO L225 Difference]: With dead ends: 13354 [2025-02-05 11:49:54,431 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 11:49:54,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2935 GetRequests, 2926 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-05 11:49:54,437 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 629 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 3017 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 3179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 3017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:49:54,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 53 Invalid, 3179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 3017 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 11:49:54,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 11:49:54,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 11:49:54,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 11:49:54,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 11:49:54,438 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1464 [2025-02-05 11:49:54,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:49:54,438 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 11:49:54,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 121.25) internal successors, (970), 8 states have internal predecessors, (970), 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 11:49:54,438 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 11:49:54,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 11:49:54,444 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 11:49:54,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-05 11:49:54,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:49:54,647 INFO L422 BasicCegarLoop]: Path program histogram: [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 11:49:54,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 11:49:55,292 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 11:49:55,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:49:55 BoogieIcfgContainer [2025-02-05 11:49:55,316 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 11:49:55,317 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 11:49:55,317 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 11:49:55,317 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 11:49:55,318 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:49:22" (3/4) ... [2025-02-05 11:49:55,319 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 11:49:55,338 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-05 11:49:55,339 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 11:49:55,340 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 11:49:55,340 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 11:49:55,436 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 11:49:55,436 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 11:49:55,436 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 11:49:55,436 INFO L158 Benchmark]: Toolchain (without parser) took 34996.81ms. Allocated memory was 201.3MB in the beginning and 327.2MB in the end (delta: 125.8MB). Free memory was 152.3MB in the beginning and 99.7MB in the end (delta: 52.6MB). Peak memory consumption was 175.2MB. Max. memory is 16.1GB. [2025-02-05 11:49:55,437 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 11:49:55,437 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.72ms. Allocated memory is still 201.3MB. Free memory was 152.3MB in the beginning and 120.4MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-05 11:49:55,437 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.58ms. Allocated memory is still 201.3MB. Free memory was 120.4MB in the beginning and 111.0MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 11:49:55,437 INFO L158 Benchmark]: Boogie Preprocessor took 89.66ms. Allocated memory is still 201.3MB. Free memory was 111.0MB in the beginning and 99.8MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 11:49:55,437 INFO L158 Benchmark]: IcfgBuilder took 1233.99ms. Allocated memory is still 201.3MB. Free memory was 99.8MB in the beginning and 83.9MB in the end (delta: 15.9MB). Peak memory consumption was 69.6MB. Max. memory is 16.1GB. [2025-02-05 11:49:55,437 INFO L158 Benchmark]: TraceAbstraction took 33080.43ms. Allocated memory was 201.3MB in the beginning and 327.2MB in the end (delta: 125.8MB). Free memory was 83.9MB in the beginning and 112.9MB in the end (delta: -29.0MB). Peak memory consumption was 129.5MB. Max. memory is 16.1GB. [2025-02-05 11:49:55,437 INFO L158 Benchmark]: Witness Printer took 119.08ms. Allocated memory is still 327.2MB. Free memory was 112.9MB in the beginning and 99.7MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 11:49:55,438 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.72ms. Allocated memory is still 201.3MB. Free memory was 152.3MB in the beginning and 120.4MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.58ms. Allocated memory is still 201.3MB. Free memory was 120.4MB in the beginning and 111.0MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.66ms. Allocated memory is still 201.3MB. Free memory was 111.0MB in the beginning and 99.8MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1233.99ms. Allocated memory is still 201.3MB. Free memory was 99.8MB in the beginning and 83.9MB in the end (delta: 15.9MB). Peak memory consumption was 69.6MB. Max. memory is 16.1GB. * TraceAbstraction took 33080.43ms. Allocated memory was 201.3MB in the beginning and 327.2MB in the end (delta: 125.8MB). Free memory was 83.9MB in the beginning and 112.9MB in the end (delta: -29.0MB). Peak memory consumption was 129.5MB. Max. memory is 16.1GB. * Witness Printer took 119.08ms. Allocated memory is still 327.2MB. Free memory was 112.9MB in the beginning and 99.7MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 137]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.4s, OverallIterations: 22, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3390 SdHoareTripleChecker+Valid, 10.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3390 mSDsluCounter, 2249 SdHoareTripleChecker+Invalid, 8.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 157 mSDsCounter, 1382 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14095 IncrementalHoareTripleChecker+Invalid, 15477 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1382 mSolverCounterUnsat, 2092 mSDtfsCounter, 14095 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11542 GetRequests, 11468 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4988occurred in iteration=20, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 5340 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 20017 NumberOfCodeBlocks, 20017 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 24479 ConstructedInterpolants, 0 QuantifiedInterpolants, 66041 SizeOfPredicates, 1 NumberOfNonLiveVariables, 8720 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 36 InterpolantComputations, 20 PerfectInterpolantSequences, 68491/71429 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 890]: Location Invariant Derived location invariant: (((((((((((((((((((((a24 == 1) && (a21 == 9)) && (a12 <= 600006)) && (81 <= a12)) || (((a24 == 1) && (a12 <= 10)) && (10 <= a21))) || (((((a21 == 8) && (a24 == 1)) && (12 <= a12)) && (a12 <= 600006)) && (8 <= a15))) || ((((a24 == 1) && (a15 <= 8)) && (a12 <= 600006)) && (10 <= a21))) || (((((7 <= a15) && (a24 == 1)) && (a15 <= 8)) && (a12 <= 10)) && (0 <= ((long long) a12 + 42)))) || ((((a12 <= 80) && (a24 == 1)) && (12 <= a12)) && (a15 <= 8))) || (((((7 <= a15) && (a24 == 1)) && (7 == a21)) && (12 <= a12)) && (a12 <= 600006))) || (((((long long) a12 + 43) <= 0) && (a21 == 9)) && (a15 <= 5))) || ((((a21 == 8) && (a24 == 1)) && (a12 <= 10)) && (8 <= a15))) || (((((7 <= a15) && (a24 == 1)) && (12 <= a12)) && (a15 <= 8)) && (a12 <= 600006))) || ((a24 == 1) && (a15 <= 5))) || ((((a24 == 1) && (12 <= a12)) && (a12 <= 600006)) && (10 <= a21))) || (((((long long) a12 + 43) <= 0) && (a21 <= 8)) && (a15 <= 5))) || (((((a12 <= 11) && (7 <= a15)) && (a21 == 8)) && (a24 == 1)) && (a15 <= 8))) || ((((a24 == 1) && (a15 <= 8)) && (a21 == 9)) && (a12 <= 600006))) || ((((7 <= a15) && (a24 == 1)) && (a15 <= 8)) && (((long long) 49 + a12) <= 0))) || ((((a24 == 1) && (7 == a21)) && (a15 <= 8)) && (a12 <= 10))) || (((a24 == 1) && (12849 <= a12)) && (0 <= ((((-1 * (((((long long) a12 * 10) + 2779120) >= 0) ? ((((long long) a12 * 10) + 2779120) / 9) : (((((long long) a12 * 10) + 2779120) / 9) - 1))) >= 0) ? ((-1 * (((((long long) a12 * 10) + 2779120) >= 0) ? ((((long long) a12 * 10) + 2779120) / 9) : (((((long long) a12 * 10) + 2779120) / 9) - 1))) / 10) : (((-1 * (((((long long) a12 * 10) + 2779120) >= 0) ? ((((long long) a12 * 10) + 2779120) / 9) : (((((long long) a12 * 10) + 2779120) / 9) - 1))) / 10) - 1)) + 43718)))) RESULT: Ultimate proved your program to be correct! [2025-02-05 11:49:55,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE