./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label00.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/Problem16_label00.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 75ebd1645cbbce4c9ca017600d59212353a954f83c001b1c580ae238d412adcc --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:56:01,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:56:01,088 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:56:01,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:56:01,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:56:01,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:56:01,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:56:01,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:56:01,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:56:01,107 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:56:01,107 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:56:01,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:56:01,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:56:01,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:56:01,108 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:56:01,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:56:01,108 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:56:01,108 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:56:01,108 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:56:01,108 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:56:01,108 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:56:01,108 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:56:01,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:56:01,108 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:56:01,108 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:56:01,108 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:56:01,108 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:56:01,108 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:56:01,108 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:56:01,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:56:01,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:56:01,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:56:01,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:56:01,109 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:56:01,109 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:56:01,109 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:56:01,109 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:56:01,109 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:56:01,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:56:01,109 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:56:01,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:56:01,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:56:01,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:56:01,109 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 -> 75ebd1645cbbce4c9ca017600d59212353a954f83c001b1c580ae238d412adcc [2025-02-05 11:56:01,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:56:01,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:56:01,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:56:01,364 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:56:01,364 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:56:01,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label00.c [2025-02-05 11:56:02,664 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7914bd3bc/4db1e2744bba4e2eb00f24ce8448990d/FLAG393af88cf [2025-02-05 11:56:02,997 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:56:02,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label00.c [2025-02-05 11:56:03,012 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7914bd3bc/4db1e2744bba4e2eb00f24ce8448990d/FLAG393af88cf [2025-02-05 11:56:03,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7914bd3bc/4db1e2744bba4e2eb00f24ce8448990d [2025-02-05 11:56:03,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:56:03,028 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:56:03,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:56:03,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:56:03,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:56:03,032 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:56:03" (1/1) ... [2025-02-05 11:56:03,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2017b91e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:03, skipping insertion in model container [2025-02-05 11:56:03,033 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:56:03" (1/1) ... [2025-02-05 11:56:03,091 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:56:03,216 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/Problem16_label00.c[2412,2425] [2025-02-05 11:56:03,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:56:03,479 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:56:03,494 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/Problem16_label00.c[2412,2425] [2025-02-05 11:56:03,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:56:03,678 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:56:03,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:03 WrapperNode [2025-02-05 11:56:03,679 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:56:03,680 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:56:03,680 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:56:03,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:56:03,687 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:56:03" (1/1) ... [2025-02-05 11:56:03,729 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:56:03" (1/1) ... [2025-02-05 11:56:03,916 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-02-05 11:56:03,917 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:56:03,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:56:03,918 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:56:03,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:56:03,932 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:03" (1/1) ... [2025-02-05 11:56:03,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:03" (1/1) ... [2025-02-05 11:56:03,963 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:03" (1/1) ... [2025-02-05 11:56:04,039 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:56:04,039 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:03" (1/1) ... [2025-02-05 11:56:04,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:03" (1/1) ... [2025-02-05 11:56:04,062 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:03" (1/1) ... [2025-02-05 11:56:04,067 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:03" (1/1) ... [2025-02-05 11:56:04,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:03" (1/1) ... [2025-02-05 11:56:04,081 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:03" (1/1) ... [2025-02-05 11:56:04,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:56:04,094 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:56:04,094 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:56:04,095 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:56:04,095 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:03" (1/1) ... [2025-02-05 11:56:04,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:56:04,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:56:04,128 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:56:04,137 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:56:04,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:56:04,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:56:04,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:56:04,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:56:04,191 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:56:04,192 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:56:05,856 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-02-05 11:56:05,940 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-02-05 11:56:05,940 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:56:05,951 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:56:05,951 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:56:05,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:56:05 BoogieIcfgContainer [2025-02-05 11:56:05,952 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:56:05,953 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:56:05,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:56:05,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:56:05,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:56:03" (1/3) ... [2025-02-05 11:56:05,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ede13e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:56:05, skipping insertion in model container [2025-02-05 11:56:05,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:56:03" (2/3) ... [2025-02-05 11:56:05,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ede13e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:56:05, skipping insertion in model container [2025-02-05 11:56:05,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:56:05" (3/3) ... [2025-02-05 11:56:05,958 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label00.c [2025-02-05 11:56:05,968 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:56:05,969 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label00.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:56:06,010 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:56:06,017 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;@3a7e250a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:56:06,018 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:56:06,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 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:56:06,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 11:56:06,025 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:06,026 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] [2025-02-05 11:56:06,026 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:06,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:06,029 INFO L85 PathProgramCache]: Analyzing trace with hash -685582940, now seen corresponding path program 1 times [2025-02-05 11:56:06,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:06,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842979895] [2025-02-05 11:56:06,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:06,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:06,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 11:56:06,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 11:56:06,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:06,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:06,212 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:56:06,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:06,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842979895] [2025-02-05 11:56:06,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842979895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:06,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:06,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:56:06,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669297227] [2025-02-05 11:56:06,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:06,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:06,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:06,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:06,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:06,252 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 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 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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:56:07,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:07,727 INFO L93 Difference]: Finished difference Result 1122 states and 2100 transitions. [2025-02-05 11:56:07,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:07,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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 21 [2025-02-05 11:56:07,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:07,743 INFO L225 Difference]: With dead ends: 1122 [2025-02-05 11:56:07,744 INFO L226 Difference]: Without dead ends: 662 [2025-02-05 11:56:07,751 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:56:07,754 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 339 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:07,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 223 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 11:56:07,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-02-05 11:56:07,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-02-05 11:56:07,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.5824508320726172) internal successors, (1046), 661 states have internal predecessors, (1046), 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:56:07,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1046 transitions. [2025-02-05 11:56:07,814 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1046 transitions. Word has length 21 [2025-02-05 11:56:07,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:07,815 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1046 transitions. [2025-02-05 11:56:07,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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:56:07,815 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1046 transitions. [2025-02-05 11:56:07,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 11:56:07,817 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:07,817 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:07,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:56:07,817 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:07,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:07,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1533467297, now seen corresponding path program 1 times [2025-02-05 11:56:07,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:07,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324679587] [2025-02-05 11:56:07,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:07,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:07,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 11:56:07,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 11:56:07,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:07,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:08,056 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:56:08,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:08,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324679587] [2025-02-05 11:56:08,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324679587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:08,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:08,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:56:08,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174882777] [2025-02-05 11:56:08,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:08,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:08,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:08,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:08,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:08,062 INFO L87 Difference]: Start difference. First operand 662 states and 1046 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 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:56:09,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:09,558 INFO L93 Difference]: Finished difference Result 1982 states and 3134 transitions. [2025-02-05 11:56:09,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:09,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 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 92 [2025-02-05 11:56:09,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:09,563 INFO L225 Difference]: With dead ends: 1982 [2025-02-05 11:56:09,563 INFO L226 Difference]: Without dead ends: 1322 [2025-02-05 11:56:09,564 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:56:09,565 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 279 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:09,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 78 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 11:56:09,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2025-02-05 11:56:09,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2025-02-05 11:56:09,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.5064442759666414) internal successors, (1987), 1319 states have internal predecessors, (1987), 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:56:09,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1987 transitions. [2025-02-05 11:56:09,595 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1987 transitions. Word has length 92 [2025-02-05 11:56:09,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:09,596 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1987 transitions. [2025-02-05 11:56:09,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 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:56:09,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1987 transitions. [2025-02-05 11:56:09,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 11:56:09,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:09,598 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:09,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:56:09,598 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:09,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:09,598 INFO L85 PathProgramCache]: Analyzing trace with hash -359166741, now seen corresponding path program 1 times [2025-02-05 11:56:09,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:09,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528535778] [2025-02-05 11:56:09,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:09,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:09,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 11:56:09,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 11:56:09,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:09,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:09,733 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:56:09,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:09,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528535778] [2025-02-05 11:56:09,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528535778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:09,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:09,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:56:09,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570741885] [2025-02-05 11:56:09,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:09,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:09,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:09,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:09,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:09,736 INFO L87 Difference]: Start difference. First operand 1320 states and 1987 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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:56:10,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:10,909 INFO L93 Difference]: Finished difference Result 3954 states and 5956 transitions. [2025-02-05 11:56:10,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:10,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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 96 [2025-02-05 11:56:10,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:10,919 INFO L225 Difference]: With dead ends: 3954 [2025-02-05 11:56:10,919 INFO L226 Difference]: Without dead ends: 2636 [2025-02-05 11:56:10,923 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:56:10,925 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 295 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:10,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 203 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 11:56:10,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2025-02-05 11:56:10,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2636. [2025-02-05 11:56:10,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 2635 states have (on average 1.3248576850094878) internal successors, (3491), 2635 states have internal predecessors, (3491), 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:56:10,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3491 transitions. [2025-02-05 11:56:10,984 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3491 transitions. Word has length 96 [2025-02-05 11:56:10,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:10,985 INFO L471 AbstractCegarLoop]: Abstraction has 2636 states and 3491 transitions. [2025-02-05 11:56:10,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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:56:10,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3491 transitions. [2025-02-05 11:56:10,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 11:56:10,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:10,987 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:10,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:56:10,987 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:10,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:10,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1170703305, now seen corresponding path program 1 times [2025-02-05 11:56:10,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:10,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240680291] [2025-02-05 11:56:10,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:10,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:11,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 11:56:11,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 11:56:11,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:11,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:11,287 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:56:11,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:11,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240680291] [2025-02-05 11:56:11,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240680291] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:56:11,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822825812] [2025-02-05 11:56:11,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:11,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:56:11,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:56:11,296 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:56:11,304 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:56:11,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 11:56:11,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 11:56:11,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:11,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:11,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:56:11,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:56:11,641 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:56:11,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:56:12,471 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:56:12,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822825812] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:56:12,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:56:12,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-05 11:56:12,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116301880] [2025-02-05 11:56:12,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:56:12,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 11:56:12,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:12,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 11:56:12,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:56:12,473 INFO L87 Difference]: Start difference. First operand 2636 states and 3491 transitions. Second operand has 6 states, 6 states have (on average 35.833333333333336) internal successors, (215), 5 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:56:16,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:16,784 INFO L93 Difference]: Finished difference Result 12510 states and 16879 transitions. [2025-02-05 11:56:16,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 11:56:16,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 35.833333333333336) internal successors, (215), 5 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 108 [2025-02-05 11:56:16,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:16,804 INFO L225 Difference]: With dead ends: 12510 [2025-02-05 11:56:16,804 INFO L226 Difference]: Without dead ends: 9876 [2025-02-05 11:56:16,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 11:56:16,808 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 2949 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 3218 mSolverCounterSat, 2093 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2949 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 5311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2093 IncrementalHoareTripleChecker+Valid, 3218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:16,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2949 Valid, 33 Invalid, 5311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2093 Valid, 3218 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-02-05 11:56:16,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9876 states. [2025-02-05 11:56:16,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9876 to 7900. [2025-02-05 11:56:16,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7900 states, 7899 states have (on average 1.2949740473477656) internal successors, (10229), 7899 states have internal predecessors, (10229), 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:56:16,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 10229 transitions. [2025-02-05 11:56:16,915 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 10229 transitions. Word has length 108 [2025-02-05 11:56:16,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:16,916 INFO L471 AbstractCegarLoop]: Abstraction has 7900 states and 10229 transitions. [2025-02-05 11:56:16,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.833333333333336) internal successors, (215), 5 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:56:16,916 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 10229 transitions. [2025-02-05 11:56:16,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-02-05 11:56:16,923 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:16,923 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:16,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 11:56:17,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:56:17,128 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:17,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:17,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1140230998, now seen corresponding path program 1 times [2025-02-05 11:56:17,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:17,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195663972] [2025-02-05 11:56:17,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:17,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:17,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-02-05 11:56:17,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-02-05 11:56:17,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:17,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:17,558 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 11:56:17,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:17,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195663972] [2025-02-05 11:56:17,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195663972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:17,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:17,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:17,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492189152] [2025-02-05 11:56:17,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:17,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:56:17,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:17,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:56:17,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:56:17,560 INFO L87 Difference]: Start difference. First operand 7900 states and 10229 transitions. Second operand has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 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:56:18,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:18,629 INFO L93 Difference]: Finished difference Result 15140 states and 19702 transitions. [2025-02-05 11:56:18,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:56:18,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 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 279 [2025-02-05 11:56:18,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:18,649 INFO L225 Difference]: With dead ends: 15140 [2025-02-05 11:56:18,649 INFO L226 Difference]: Without dead ends: 7900 [2025-02-05 11:56:18,654 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:56:18,655 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 377 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:18,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 322 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1469 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 11:56:18,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7900 states. [2025-02-05 11:56:18,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 7900. [2025-02-05 11:56:18,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7900 states, 7899 states have (on average 1.2934548677047728) internal successors, (10217), 7899 states have internal predecessors, (10217), 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:56:18,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 10217 transitions. [2025-02-05 11:56:18,747 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 10217 transitions. Word has length 279 [2025-02-05 11:56:18,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:18,749 INFO L471 AbstractCegarLoop]: Abstraction has 7900 states and 10217 transitions. [2025-02-05 11:56:18,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 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:56:18,749 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 10217 transitions. [2025-02-05 11:56:18,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-02-05 11:56:18,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:18,754 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:18,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:56:18,754 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:18,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:18,755 INFO L85 PathProgramCache]: Analyzing trace with hash 535933050, now seen corresponding path program 1 times [2025-02-05 11:56:18,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:18,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789038099] [2025-02-05 11:56:18,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:18,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:18,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-02-05 11:56:18,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-02-05 11:56:18,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:18,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:19,151 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:56:19,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:19,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789038099] [2025-02-05 11:56:19,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789038099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:19,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:19,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 11:56:19,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416016929] [2025-02-05 11:56:19,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:19,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 11:56:19,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:19,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 11:56:19,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:56:19,153 INFO L87 Difference]: Start difference. First operand 7900 states and 10217 transitions. Second operand has 7 states, 7 states have (on average 45.57142857142857) internal successors, (319), 6 states have internal predecessors, (319), 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:56:20,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:20,673 INFO L93 Difference]: Finished difference Result 15347 states and 19821 transitions. [2025-02-05 11:56:20,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 11:56:20,674 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 45.57142857142857) internal successors, (319), 6 states have internal predecessors, (319), 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 319 [2025-02-05 11:56:20,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:20,699 INFO L225 Difference]: With dead ends: 15347 [2025-02-05 11:56:20,699 INFO L226 Difference]: Without dead ends: 7651 [2025-02-05 11:56:20,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:56:20,706 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 309 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 2350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:20,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 284 Invalid, 2350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 11:56:20,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7651 states. [2025-02-05 11:56:20,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7651 to 7591. [2025-02-05 11:56:20,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7591 states, 7590 states have (on average 1.1188405797101448) internal successors, (8492), 7590 states have internal predecessors, (8492), 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:56:20,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7591 states to 7591 states and 8492 transitions. [2025-02-05 11:56:20,792 INFO L78 Accepts]: Start accepts. Automaton has 7591 states and 8492 transitions. Word has length 319 [2025-02-05 11:56:20,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:20,792 INFO L471 AbstractCegarLoop]: Abstraction has 7591 states and 8492 transitions. [2025-02-05 11:56:20,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 45.57142857142857) internal successors, (319), 6 states have internal predecessors, (319), 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:56:20,793 INFO L276 IsEmpty]: Start isEmpty. Operand 7591 states and 8492 transitions. [2025-02-05 11:56:20,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-02-05 11:56:20,797 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:20,798 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:20,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:56:20,798 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:20,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:20,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1513374992, now seen corresponding path program 1 times [2025-02-05 11:56:20,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:20,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681374412] [2025-02-05 11:56:20,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:20,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:20,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-02-05 11:56:20,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-02-05 11:56:20,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:20,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:21,053 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 37 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:56:21,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:21,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681374412] [2025-02-05 11:56:21,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681374412] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:56:21,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897303653] [2025-02-05 11:56:21,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:21,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:56:21,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:56:21,059 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:56:21,061 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:56:21,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-02-05 11:56:21,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-02-05 11:56:21,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:21,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:21,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:56:21,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:56:21,499 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-05 11:56:21,500 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:56:21,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897303653] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:21,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:56:21,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-02-05 11:56:21,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954191417] [2025-02-05 11:56:21,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:21,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:21,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:21,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:21,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:56:21,502 INFO L87 Difference]: Start difference. First operand 7591 states and 8492 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 2 states have internal predecessors, (266), 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:56:22,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:22,163 INFO L93 Difference]: Finished difference Result 16496 states and 18417 transitions. [2025-02-05 11:56:22,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:22,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 2 states have internal predecessors, (266), 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 371 [2025-02-05 11:56:22,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:22,182 INFO L225 Difference]: With dead ends: 16496 [2025-02-05 11:56:22,182 INFO L226 Difference]: Without dead ends: 9565 [2025-02-05 11:56:22,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:56:22,189 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 125 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:22,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 34 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:56:22,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9565 states. [2025-02-05 11:56:22,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9565 to 9565. [2025-02-05 11:56:22,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9565 states, 9564 states have (on average 1.0869928900041823) internal successors, (10396), 9564 states have internal predecessors, (10396), 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:56:22,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9565 states to 9565 states and 10396 transitions. [2025-02-05 11:56:22,271 INFO L78 Accepts]: Start accepts. Automaton has 9565 states and 10396 transitions. Word has length 371 [2025-02-05 11:56:22,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:22,271 INFO L471 AbstractCegarLoop]: Abstraction has 9565 states and 10396 transitions. [2025-02-05 11:56:22,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 2 states have internal predecessors, (266), 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:56:22,272 INFO L276 IsEmpty]: Start isEmpty. Operand 9565 states and 10396 transitions. [2025-02-05 11:56:22,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2025-02-05 11:56:22,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:22,278 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:22,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 11:56:22,482 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:56:22,482 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:22,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:22,483 INFO L85 PathProgramCache]: Analyzing trace with hash 288653038, now seen corresponding path program 1 times [2025-02-05 11:56:22,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:22,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258192730] [2025-02-05 11:56:22,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:22,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:22,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-02-05 11:56:22,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-02-05 11:56:22,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:22,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:23,244 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-02-05 11:56:23,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:23,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258192730] [2025-02-05 11:56:23,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258192730] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:23,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:23,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:56:23,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888615509] [2025-02-05 11:56:23,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:23,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:23,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:23,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:23,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:23,247 INFO L87 Difference]: Start difference. First operand 9565 states and 10396 transitions. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 2 states have internal predecessors, (283), 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:56:23,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:23,922 INFO L93 Difference]: Finished difference Result 18470 states and 20119 transitions. [2025-02-05 11:56:23,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:23,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 2 states have internal predecessors, (283), 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 516 [2025-02-05 11:56:23,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:23,937 INFO L225 Difference]: With dead ends: 18470 [2025-02-05 11:56:23,937 INFO L226 Difference]: Without dead ends: 9565 [2025-02-05 11:56:23,944 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:56:23,945 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 70 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:23,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 124 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:56:23,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9565 states. [2025-02-05 11:56:24,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9565 to 9565. [2025-02-05 11:56:24,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9565 states, 9564 states have (on average 1.086783772480134) internal successors, (10394), 9564 states have internal predecessors, (10394), 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:56:24,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9565 states to 9565 states and 10394 transitions. [2025-02-05 11:56:24,025 INFO L78 Accepts]: Start accepts. Automaton has 9565 states and 10394 transitions. Word has length 516 [2025-02-05 11:56:24,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:24,026 INFO L471 AbstractCegarLoop]: Abstraction has 9565 states and 10394 transitions. [2025-02-05 11:56:24,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 2 states have internal predecessors, (283), 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:56:24,026 INFO L276 IsEmpty]: Start isEmpty. Operand 9565 states and 10394 transitions. [2025-02-05 11:56:24,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2025-02-05 11:56:24,035 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:24,035 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:24,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:56:24,035 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:24,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:24,036 INFO L85 PathProgramCache]: Analyzing trace with hash 831583321, now seen corresponding path program 1 times [2025-02-05 11:56:24,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:24,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392426085] [2025-02-05 11:56:24,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:24,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:24,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 522 statements into 1 equivalence classes. [2025-02-05 11:56:24,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 522 of 522 statements. [2025-02-05 11:56:24,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:24,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:24,295 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 408 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 11:56:24,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:24,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392426085] [2025-02-05 11:56:24,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392426085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:24,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:24,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:24,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331973653] [2025-02-05 11:56:24,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:24,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:24,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:24,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:24,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:24,298 INFO L87 Difference]: Start difference. First operand 9565 states and 10394 transitions. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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:56:25,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:25,081 INFO L93 Difference]: Finished difference Result 21102 states and 23130 transitions. [2025-02-05 11:56:25,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:25,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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 522 [2025-02-05 11:56:25,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:25,096 INFO L225 Difference]: With dead ends: 21102 [2025-02-05 11:56:25,096 INFO L226 Difference]: Without dead ends: 11868 [2025-02-05 11:56:25,101 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:56:25,103 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 171 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:25,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 457 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:56:25,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2025-02-05 11:56:25,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 11868. [2025-02-05 11:56:25,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11868 states, 11867 states have (on average 1.0784528524479648) internal successors, (12798), 11867 states have internal predecessors, (12798), 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:56:25,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11868 states to 11868 states and 12798 transitions. [2025-02-05 11:56:25,193 INFO L78 Accepts]: Start accepts. Automaton has 11868 states and 12798 transitions. Word has length 522 [2025-02-05 11:56:25,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:25,194 INFO L471 AbstractCegarLoop]: Abstraction has 11868 states and 12798 transitions. [2025-02-05 11:56:25,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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:56:25,194 INFO L276 IsEmpty]: Start isEmpty. Operand 11868 states and 12798 transitions. [2025-02-05 11:56:25,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-02-05 11:56:25,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:25,197 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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:56:25,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:56:25,197 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:25,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:25,198 INFO L85 PathProgramCache]: Analyzing trace with hash 929768854, now seen corresponding path program 1 times [2025-02-05 11:56:25,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:25,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088199641] [2025-02-05 11:56:25,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:25,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:25,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-02-05 11:56:25,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-02-05 11:56:25,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:25,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:25,569 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 37 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:56:25,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:25,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088199641] [2025-02-05 11:56:25,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088199641] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:56:25,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422787276] [2025-02-05 11:56:25,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:25,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:56:25,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:56:25,575 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:56:25,577 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:56:25,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-02-05 11:56:25,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-02-05 11:56:25,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:25,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:25,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 11:56:25,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:56:26,192 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:56:26,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:56:26,817 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 37 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:56:26,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422787276] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:56:26,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:56:26,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-02-05 11:56:26,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223646867] [2025-02-05 11:56:26,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:56:26,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 11:56:26,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:26,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 11:56:26,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2025-02-05 11:56:26,821 INFO L87 Difference]: Start difference. First operand 11868 states and 12798 transitions. Second operand has 11 states, 11 states have (on average 144.9090909090909) internal successors, (1594), 10 states have internal predecessors, (1594), 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:56:30,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:30,083 INFO L93 Difference]: Finished difference Result 30084 states and 32748 transitions. [2025-02-05 11:56:30,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 11:56:30,083 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 144.9090909090909) internal successors, (1594), 10 states have internal predecessors, (1594), 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 532 [2025-02-05 11:56:30,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:30,135 INFO L225 Difference]: With dead ends: 30084 [2025-02-05 11:56:30,135 INFO L226 Difference]: Without dead ends: 18837 [2025-02-05 11:56:30,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1066 GetRequests, 1057 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2025-02-05 11:56:30,155 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 976 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5866 mSolverCounterSat, 547 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 6413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 547 IncrementalHoareTripleChecker+Valid, 5866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:30,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 93 Invalid, 6413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [547 Valid, 5866 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-05 11:56:30,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18837 states. [2025-02-05 11:56:30,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18837 to 15158. [2025-02-05 11:56:30,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15158 states, 15157 states have (on average 1.0688790657781884) internal successors, (16201), 15157 states have internal predecessors, (16201), 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:56:30,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15158 states to 15158 states and 16201 transitions. [2025-02-05 11:56:30,296 INFO L78 Accepts]: Start accepts. Automaton has 15158 states and 16201 transitions. Word has length 532 [2025-02-05 11:56:30,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:30,296 INFO L471 AbstractCegarLoop]: Abstraction has 15158 states and 16201 transitions. [2025-02-05 11:56:30,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 144.9090909090909) internal successors, (1594), 10 states have internal predecessors, (1594), 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:56:30,297 INFO L276 IsEmpty]: Start isEmpty. Operand 15158 states and 16201 transitions. [2025-02-05 11:56:30,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2025-02-05 11:56:30,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:30,303 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:30,310 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:56:30,504 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:56:30,505 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:30,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:30,506 INFO L85 PathProgramCache]: Analyzing trace with hash 871004406, now seen corresponding path program 1 times [2025-02-05 11:56:30,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:30,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698729698] [2025-02-05 11:56:30,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:30,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:30,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 663 statements into 1 equivalence classes. [2025-02-05 11:56:30,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 663 of 663 statements. [2025-02-05 11:56:30,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:30,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:30,860 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 793 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-05 11:56:30,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:30,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698729698] [2025-02-05 11:56:30,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698729698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:30,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:30,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:30,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334272991] [2025-02-05 11:56:30,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:30,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:30,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:30,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:30,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:30,862 INFO L87 Difference]: Start difference. First operand 15158 states and 16201 transitions. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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:56:31,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:31,603 INFO L93 Difference]: Finished difference Result 32288 states and 34773 transitions. [2025-02-05 11:56:31,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:31,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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 663 [2025-02-05 11:56:31,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:31,626 INFO L225 Difference]: With dead ends: 32288 [2025-02-05 11:56:31,627 INFO L226 Difference]: Without dead ends: 18448 [2025-02-05 11:56:31,639 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:56:31,641 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 225 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:31,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 40 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:56:31,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18448 states. [2025-02-05 11:56:31,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18448 to 18448. [2025-02-05 11:56:31,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18448 states, 18447 states have (on average 1.0739415623136552) internal successors, (19811), 18447 states have internal predecessors, (19811), 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:56:31,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18448 states to 18448 states and 19811 transitions. [2025-02-05 11:56:31,813 INFO L78 Accepts]: Start accepts. Automaton has 18448 states and 19811 transitions. Word has length 663 [2025-02-05 11:56:31,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:31,813 INFO L471 AbstractCegarLoop]: Abstraction has 18448 states and 19811 transitions. [2025-02-05 11:56:31,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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:56:31,813 INFO L276 IsEmpty]: Start isEmpty. Operand 18448 states and 19811 transitions. [2025-02-05 11:56:31,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2025-02-05 11:56:31,821 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:31,821 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:31,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:56:31,821 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:31,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:31,821 INFO L85 PathProgramCache]: Analyzing trace with hash -786991497, now seen corresponding path program 1 times [2025-02-05 11:56:31,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:31,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793369212] [2025-02-05 11:56:31,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:31,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:31,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 697 statements into 1 equivalence classes. [2025-02-05 11:56:31,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 697 of 697 statements. [2025-02-05 11:56:31,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:31,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:32,074 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 507 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2025-02-05 11:56:32,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:32,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793369212] [2025-02-05 11:56:32,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793369212] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:32,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:32,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:32,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693779348] [2025-02-05 11:56:32,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:32,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:32,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:32,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:32,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:32,076 INFO L87 Difference]: Start difference. First operand 18448 states and 19811 transitions. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 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:56:32,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:32,856 INFO L93 Difference]: Finished difference Result 39855 states and 43030 transitions. [2025-02-05 11:56:32,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:32,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 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 697 [2025-02-05 11:56:32,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:32,880 INFO L225 Difference]: With dead ends: 39855 [2025-02-05 11:56:32,880 INFO L226 Difference]: Without dead ends: 22725 [2025-02-05 11:56:32,893 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:56:32,894 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 155 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:32,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 438 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:56:32,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22725 states. [2025-02-05 11:56:33,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22725 to 20422. [2025-02-05 11:56:33,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20422 states, 20421 states have (on average 1.0712012144361196) internal successors, (21875), 20421 states have internal predecessors, (21875), 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:56:33,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20422 states to 20422 states and 21875 transitions. [2025-02-05 11:56:33,077 INFO L78 Accepts]: Start accepts. Automaton has 20422 states and 21875 transitions. Word has length 697 [2025-02-05 11:56:33,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:33,078 INFO L471 AbstractCegarLoop]: Abstraction has 20422 states and 21875 transitions. [2025-02-05 11:56:33,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 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:56:33,078 INFO L276 IsEmpty]: Start isEmpty. Operand 20422 states and 21875 transitions. [2025-02-05 11:56:33,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 754 [2025-02-05 11:56:33,087 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:33,087 INFO L218 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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] [2025-02-05 11:56:33,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:56:33,087 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:33,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:33,088 INFO L85 PathProgramCache]: Analyzing trace with hash 121565481, now seen corresponding path program 1 times [2025-02-05 11:56:33,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:33,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494069166] [2025-02-05 11:56:33,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:33,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:33,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 753 statements into 1 equivalence classes. [2025-02-05 11:56:33,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 753 of 753 statements. [2025-02-05 11:56:33,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:33,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:33,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2025-02-05 11:56:33,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:33,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494069166] [2025-02-05 11:56:33,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494069166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:33,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:33,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:33,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529150690] [2025-02-05 11:56:33,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:33,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:33,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:33,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:33,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:33,502 INFO L87 Difference]: Start difference. First operand 20422 states and 21875 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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:56:34,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:34,331 INFO L93 Difference]: Finished difference Result 45777 states and 49200 transitions. [2025-02-05 11:56:34,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:34,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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 753 [2025-02-05 11:56:34,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:34,358 INFO L225 Difference]: With dead ends: 45777 [2025-02-05 11:56:34,358 INFO L226 Difference]: Without dead ends: 26344 [2025-02-05 11:56:34,373 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:56:34,374 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 273 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:34,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 430 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:56:34,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26344 states. [2025-02-05 11:56:34,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26344 to 24699. [2025-02-05 11:56:34,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24699 states, 24698 states have (on average 1.0598833913677221) internal successors, (26177), 24698 states have internal predecessors, (26177), 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:56:34,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24699 states to 24699 states and 26177 transitions. [2025-02-05 11:56:34,572 INFO L78 Accepts]: Start accepts. Automaton has 24699 states and 26177 transitions. Word has length 753 [2025-02-05 11:56:34,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:34,573 INFO L471 AbstractCegarLoop]: Abstraction has 24699 states and 26177 transitions. [2025-02-05 11:56:34,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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:56:34,574 INFO L276 IsEmpty]: Start isEmpty. Operand 24699 states and 26177 transitions. [2025-02-05 11:56:34,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 782 [2025-02-05 11:56:34,583 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:34,583 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:34,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 11:56:34,584 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:34,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:34,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1677601850, now seen corresponding path program 1 times [2025-02-05 11:56:34,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:34,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955256817] [2025-02-05 11:56:34,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:34,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:34,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 781 statements into 1 equivalence classes. [2025-02-05 11:56:34,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 781 of 781 statements. [2025-02-05 11:56:34,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:34,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:35,261 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 38 proven. 502 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-02-05 11:56:35,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:35,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955256817] [2025-02-05 11:56:35,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955256817] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:56:35,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750743008] [2025-02-05 11:56:35,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:35,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:56:35,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:56:35,267 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:56:35,268 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:56:35,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 781 statements into 1 equivalence classes. [2025-02-05 11:56:35,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 781 of 781 statements. [2025-02-05 11:56:35,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:35,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:35,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:56:35,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:56:35,458 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2025-02-05 11:56:35,458 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:56:35,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750743008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:35,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:56:35,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 11:56:35,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467004596] [2025-02-05 11:56:35,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:35,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:35,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:35,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:35,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:56:35,460 INFO L87 Difference]: Start difference. First operand 24699 states and 26177 transitions. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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:56:36,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:36,200 INFO L93 Difference]: Finished difference Result 52028 states and 55215 transitions. [2025-02-05 11:56:36,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:36,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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 781 [2025-02-05 11:56:36,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:36,226 INFO L225 Difference]: With dead ends: 52028 [2025-02-05 11:56:36,226 INFO L226 Difference]: Without dead ends: 28318 [2025-02-05 11:56:36,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 785 GetRequests, 781 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:56:36,245 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 342 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:36,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 389 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:56:36,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28318 states. [2025-02-05 11:56:36,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28318 to 27002. [2025-02-05 11:56:36,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27002 states, 27001 states have (on average 1.05851635124625) internal successors, (28581), 27001 states have internal predecessors, (28581), 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:56:36,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27002 states to 27002 states and 28581 transitions. [2025-02-05 11:56:36,548 INFO L78 Accepts]: Start accepts. Automaton has 27002 states and 28581 transitions. Word has length 781 [2025-02-05 11:56:36,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:36,548 INFO L471 AbstractCegarLoop]: Abstraction has 27002 states and 28581 transitions. [2025-02-05 11:56:36,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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:56:36,549 INFO L276 IsEmpty]: Start isEmpty. Operand 27002 states and 28581 transitions. [2025-02-05 11:56:36,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 784 [2025-02-05 11:56:36,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:36,558 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:36,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 11:56:36,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-05 11:56:36,758 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:36,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:36,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1384295194, now seen corresponding path program 1 times [2025-02-05 11:56:36,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:36,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99247982] [2025-02-05 11:56:36,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:36,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:36,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 783 statements into 1 equivalence classes. [2025-02-05 11:56:36,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 783 of 783 statements. [2025-02-05 11:56:36,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:36,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:37,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 908 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-05 11:56:37,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:37,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99247982] [2025-02-05 11:56:37,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99247982] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:37,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:37,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:37,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771972814] [2025-02-05 11:56:37,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:37,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:56:37,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:37,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:56:37,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:56:37,294 INFO L87 Difference]: Start difference. First operand 27002 states and 28581 transitions. Second operand has 4 states, 4 states have (on average 144.25) internal successors, (577), 3 states have internal predecessors, (577), 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:56:38,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:38,247 INFO L93 Difference]: Finished difference Result 53344 states and 56494 transitions. [2025-02-05 11:56:38,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:38,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 144.25) internal successors, (577), 3 states have internal predecessors, (577), 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 783 [2025-02-05 11:56:38,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:38,276 INFO L225 Difference]: With dead ends: 53344 [2025-02-05 11:56:38,277 INFO L226 Difference]: Without dead ends: 27331 [2025-02-05 11:56:38,295 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:56:38,296 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 173 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:38,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 121 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:56:38,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27331 states. [2025-02-05 11:56:38,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27331 to 27331. [2025-02-05 11:56:38,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27331 states, 27330 states have (on average 1.0578851079399927) internal successors, (28912), 27330 states have internal predecessors, (28912), 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:56:38,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27331 states to 27331 states and 28912 transitions. [2025-02-05 11:56:38,602 INFO L78 Accepts]: Start accepts. Automaton has 27331 states and 28912 transitions. Word has length 783 [2025-02-05 11:56:38,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:38,602 INFO L471 AbstractCegarLoop]: Abstraction has 27331 states and 28912 transitions. [2025-02-05 11:56:38,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 144.25) internal successors, (577), 3 states have internal predecessors, (577), 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:56:38,602 INFO L276 IsEmpty]: Start isEmpty. Operand 27331 states and 28912 transitions. [2025-02-05 11:56:38,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 819 [2025-02-05 11:56:38,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:38,623 INFO L218 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 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:56:38,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 11:56:38,623 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:38,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:38,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1022008266, now seen corresponding path program 1 times [2025-02-05 11:56:38,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:38,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369955683] [2025-02-05 11:56:38,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:38,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:38,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 818 statements into 1 equivalence classes. [2025-02-05 11:56:38,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 818 of 818 statements. [2025-02-05 11:56:38,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:38,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:38,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 709 proven. 0 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2025-02-05 11:56:38,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:38,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369955683] [2025-02-05 11:56:38,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369955683] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:38,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:38,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:38,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597412945] [2025-02-05 11:56:38,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:38,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:38,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:38,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:38,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:38,942 INFO L87 Difference]: Start difference. First operand 27331 states and 28912 transitions. Second operand has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 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:56:39,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:39,670 INFO L93 Difference]: Finished difference Result 53344 states and 56491 transitions. [2025-02-05 11:56:39,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:39,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 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 818 [2025-02-05 11:56:39,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:39,697 INFO L225 Difference]: With dead ends: 53344 [2025-02-05 11:56:39,697 INFO L226 Difference]: Without dead ends: 27331 [2025-02-05 11:56:39,713 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:56:39,713 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 165 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:39,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 430 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:56:39,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27331 states. [2025-02-05 11:56:39,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27331 to 26344. [2025-02-05 11:56:39,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26344 states, 26343 states have (on average 1.0539422237406522) internal successors, (27764), 26343 states have internal predecessors, (27764), 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:56:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26344 states to 26344 states and 27764 transitions. [2025-02-05 11:56:39,932 INFO L78 Accepts]: Start accepts. Automaton has 26344 states and 27764 transitions. Word has length 818 [2025-02-05 11:56:39,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:39,933 INFO L471 AbstractCegarLoop]: Abstraction has 26344 states and 27764 transitions. [2025-02-05 11:56:39,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 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:56:39,933 INFO L276 IsEmpty]: Start isEmpty. Operand 26344 states and 27764 transitions. [2025-02-05 11:56:39,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 921 [2025-02-05 11:56:39,944 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:39,945 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:39,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 11:56:39,945 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:39,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:39,946 INFO L85 PathProgramCache]: Analyzing trace with hash -106798795, now seen corresponding path program 1 times [2025-02-05 11:56:39,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:39,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9620442] [2025-02-05 11:56:39,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:39,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:39,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 920 statements into 1 equivalence classes. [2025-02-05 11:56:40,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 920 of 920 statements. [2025-02-05 11:56:40,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:40,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:40,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 839 proven. 139 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-02-05 11:56:40,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:40,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9620442] [2025-02-05 11:56:40,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9620442] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:56:40,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065147769] [2025-02-05 11:56:40,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:40,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:56:40,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:56:40,858 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:56:40,859 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:56:40,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 920 statements into 1 equivalence classes. [2025-02-05 11:56:41,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 920 of 920 statements. [2025-02-05 11:56:41,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:41,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:41,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 1063 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 11:56:41,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:56:43,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 801 proven. 201 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-02-05 11:56:43,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:56:46,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 801 proven. 201 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-02-05 11:56:46,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065147769] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:56:46,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:56:46,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-02-05 11:56:46,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265569426] [2025-02-05 11:56:46,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:56:46,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 11:56:46,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:46,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 11:56:46,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:56:46,325 INFO L87 Difference]: Start difference. First operand 26344 states and 27764 transitions. Second operand has 9 states, 9 states have (on average 205.66666666666666) internal successors, (1851), 9 states have internal predecessors, (1851), 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:56:49,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:49,695 INFO L93 Difference]: Finished difference Result 60949 states and 64294 transitions. [2025-02-05 11:56:49,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 11:56:49,696 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 205.66666666666666) internal successors, (1851), 9 states have internal predecessors, (1851), 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 920 [2025-02-05 11:56:49,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:49,730 INFO L225 Difference]: With dead ends: 60949 [2025-02-05 11:56:49,730 INFO L226 Difference]: Without dead ends: 35904 [2025-02-05 11:56:49,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1855 GetRequests, 1842 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2025-02-05 11:56:49,750 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 1686 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 4619 mSolverCounterSat, 399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1686 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 5018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 4619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:49,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1686 Valid, 58 Invalid, 5018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [399 Valid, 4619 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-05 11:56:49,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35904 states. [2025-02-05 11:56:49,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35904 to 30621. [2025-02-05 11:56:50,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30621 states, 30620 states have (on average 1.0566623122142391) internal successors, (32355), 30620 states have internal predecessors, (32355), 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:56:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30621 states to 30621 states and 32355 transitions. [2025-02-05 11:56:50,039 INFO L78 Accepts]: Start accepts. Automaton has 30621 states and 32355 transitions. Word has length 920 [2025-02-05 11:56:50,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:50,039 INFO L471 AbstractCegarLoop]: Abstraction has 30621 states and 32355 transitions. [2025-02-05 11:56:50,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 205.66666666666666) internal successors, (1851), 9 states have internal predecessors, (1851), 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:56:50,040 INFO L276 IsEmpty]: Start isEmpty. Operand 30621 states and 32355 transitions. [2025-02-05 11:56:50,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1259 [2025-02-05 11:56:50,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:50,056 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:50,062 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:56:50,256 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,SelfDestructingSolverStorable16 [2025-02-05 11:56:50,256 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:50,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:50,257 INFO L85 PathProgramCache]: Analyzing trace with hash -2080637555, now seen corresponding path program 1 times [2025-02-05 11:56:50,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:50,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607509386] [2025-02-05 11:56:50,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:50,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:50,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1258 statements into 1 equivalence classes. [2025-02-05 11:56:50,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1258 of 1258 statements. [2025-02-05 11:56:50,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:50,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:51,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3977 backedges. 2383 proven. 0 refuted. 0 times theorem prover too weak. 1594 trivial. 0 not checked. [2025-02-05 11:56:51,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:51,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607509386] [2025-02-05 11:56:51,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607509386] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:51,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:51,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:51,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764220763] [2025-02-05 11:56:51,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:51,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:51,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:51,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:51,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:51,123 INFO L87 Difference]: Start difference. First operand 30621 states and 32355 transitions. Second operand has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 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:56:52,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:52,037 INFO L93 Difference]: Finished difference Result 59595 states and 63043 transitions. [2025-02-05 11:56:52,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:52,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 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 1258 [2025-02-05 11:56:52,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:52,064 INFO L225 Difference]: With dead ends: 59595 [2025-02-05 11:56:52,064 INFO L226 Difference]: Without dead ends: 30292 [2025-02-05 11:56:52,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:56:52,081 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 212 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:52,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 38 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:56:52,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30292 states. [2025-02-05 11:56:52,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30292 to 30292. [2025-02-05 11:56:52,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30292 states, 30291 states have (on average 1.0465484797464593) internal successors, (31701), 30291 states have internal predecessors, (31701), 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:56:52,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30292 states to 30292 states and 31701 transitions. [2025-02-05 11:56:52,503 INFO L78 Accepts]: Start accepts. Automaton has 30292 states and 31701 transitions. Word has length 1258 [2025-02-05 11:56:52,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:52,505 INFO L471 AbstractCegarLoop]: Abstraction has 30292 states and 31701 transitions. [2025-02-05 11:56:52,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 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:56:52,505 INFO L276 IsEmpty]: Start isEmpty. Operand 30292 states and 31701 transitions. [2025-02-05 11:56:52,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1351 [2025-02-05 11:56:52,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:52,521 INFO L218 NwaCegarLoop]: trace histogram [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, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:56:52,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 11:56:52,522 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:52,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:52,523 INFO L85 PathProgramCache]: Analyzing trace with hash 2027773440, now seen corresponding path program 1 times [2025-02-05 11:56:52,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:52,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516390360] [2025-02-05 11:56:52,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:52,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:52,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1350 statements into 1 equivalence classes. [2025-02-05 11:56:52,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1350 of 1350 statements. [2025-02-05 11:56:52,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:52,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:53,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3895 backedges. 1580 proven. 0 refuted. 0 times theorem prover too weak. 2315 trivial. 0 not checked. [2025-02-05 11:56:53,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:53,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516390360] [2025-02-05 11:56:53,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516390360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:53,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:53,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:53,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814862872] [2025-02-05 11:56:53,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:53,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:53,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:53,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:53,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:53,296 INFO L87 Difference]: Start difference. First operand 30292 states and 31701 transitions. Second operand has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 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:56:54,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:54,080 INFO L93 Difference]: Finished difference Result 59924 states and 62763 transitions. [2025-02-05 11:56:54,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:54,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 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 1350 [2025-02-05 11:56:54,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:54,104 INFO L225 Difference]: With dead ends: 59924 [2025-02-05 11:56:54,105 INFO L226 Difference]: Without dead ends: 30621 [2025-02-05 11:56:54,119 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:56:54,120 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 146 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:54,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 419 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:56:54,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30621 states. [2025-02-05 11:56:54,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30621 to 25686. [2025-02-05 11:56:54,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25686 states, 25685 states have (on average 1.0354681720848744) internal successors, (26596), 25685 states have internal predecessors, (26596), 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:56:54,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25686 states to 25686 states and 26596 transitions. [2025-02-05 11:56:54,410 INFO L78 Accepts]: Start accepts. Automaton has 25686 states and 26596 transitions. Word has length 1350 [2025-02-05 11:56:54,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:54,411 INFO L471 AbstractCegarLoop]: Abstraction has 25686 states and 26596 transitions. [2025-02-05 11:56:54,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 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:56:54,411 INFO L276 IsEmpty]: Start isEmpty. Operand 25686 states and 26596 transitions. [2025-02-05 11:56:54,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1472 [2025-02-05 11:56:54,428 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:54,428 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 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, 1, 1, 1, 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:56:54,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 11:56:54,429 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:54,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:54,430 INFO L85 PathProgramCache]: Analyzing trace with hash 680160246, now seen corresponding path program 1 times [2025-02-05 11:56:54,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:54,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64368583] [2025-02-05 11:56:54,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:54,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:54,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1471 statements into 1 equivalence classes. [2025-02-05 11:56:54,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1471 of 1471 statements. [2025-02-05 11:56:54,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:54,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:56,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4315 backedges. 1956 proven. 1618 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2025-02-05 11:56:56,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:56,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64368583] [2025-02-05 11:56:56,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64368583] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:56:56,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609672352] [2025-02-05 11:56:56,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:56,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:56:56,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:56:56,255 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:56:56,256 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:56:56,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1471 statements into 1 equivalence classes. [2025-02-05 11:56:56,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1471 of 1471 statements. [2025-02-05 11:56:56,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:56,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:56,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 1728 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:56:56,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:56:56,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4315 backedges. 2124 proven. 0 refuted. 0 times theorem prover too weak. 2191 trivial. 0 not checked. [2025-02-05 11:56:56,822 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:56:56,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609672352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:56,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:56:56,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 11:56:56,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217030014] [2025-02-05 11:56:56,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:56,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:56,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:56,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:56,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:56:56,824 INFO L87 Difference]: Start difference. First operand 25686 states and 26596 transitions. Second operand has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 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:56:57,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:57,552 INFO L93 Difference]: Finished difference Result 49725 states and 51530 transitions. [2025-02-05 11:56:57,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:57,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 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 1471 [2025-02-05 11:56:57,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:57,574 INFO L225 Difference]: With dead ends: 49725 [2025-02-05 11:56:57,574 INFO L226 Difference]: Without dead ends: 25357 [2025-02-05 11:56:57,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1477 GetRequests, 1472 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:56:57,590 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 63 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:57,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 419 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:56:57,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25357 states. [2025-02-05 11:56:57,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25357 to 24370. [2025-02-05 11:56:57,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24370 states, 24369 states have (on average 1.0296278058188681) internal successors, (25091), 24369 states have internal predecessors, (25091), 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:56:57,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24370 states to 24370 states and 25091 transitions. [2025-02-05 11:56:57,783 INFO L78 Accepts]: Start accepts. Automaton has 24370 states and 25091 transitions. Word has length 1471 [2025-02-05 11:56:57,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:57,784 INFO L471 AbstractCegarLoop]: Abstraction has 24370 states and 25091 transitions. [2025-02-05 11:56:57,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 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:56:57,784 INFO L276 IsEmpty]: Start isEmpty. Operand 24370 states and 25091 transitions. [2025-02-05 11:56:57,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1495 [2025-02-05 11:56:57,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:57,805 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:57,813 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:56:58,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:56:58,010 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:58,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:58,011 INFO L85 PathProgramCache]: Analyzing trace with hash 498222929, now seen corresponding path program 1 times [2025-02-05 11:56:58,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:58,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377469138] [2025-02-05 11:56:58,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:58,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:58,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1494 statements into 1 equivalence classes. [2025-02-05 11:56:58,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1494 of 1494 statements. [2025-02-05 11:56:58,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:58,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:56:58,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4767 backedges. 937 proven. 0 refuted. 0 times theorem prover too weak. 3830 trivial. 0 not checked. [2025-02-05 11:56:58,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:56:58,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377469138] [2025-02-05 11:56:58,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377469138] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:56:58,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:56:58,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:56:58,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574558783] [2025-02-05 11:56:58,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:56:58,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:56:58,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:56:58,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:56:58,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:56:58,685 INFO L87 Difference]: Start difference. First operand 24370 states and 25091 transitions. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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:56:59,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:56:59,375 INFO L93 Difference]: Finished difference Result 46435 states and 47808 transitions. [2025-02-05 11:56:59,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:56:59,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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 1494 [2025-02-05 11:56:59,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:56:59,394 INFO L225 Difference]: With dead ends: 46435 [2025-02-05 11:56:59,395 INFO L226 Difference]: Without dead ends: 23383 [2025-02-05 11:56:59,405 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:56:59,406 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 243 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:56:59,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 436 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:56:59,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23383 states. [2025-02-05 11:56:59,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23383 to 21738. [2025-02-05 11:56:59,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21738 states, 21737 states have (on average 1.0237843308644248) internal successors, (22254), 21737 states have internal predecessors, (22254), 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:56:59,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21738 states to 21738 states and 22254 transitions. [2025-02-05 11:56:59,550 INFO L78 Accepts]: Start accepts. Automaton has 21738 states and 22254 transitions. Word has length 1494 [2025-02-05 11:56:59,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:56:59,551 INFO L471 AbstractCegarLoop]: Abstraction has 21738 states and 22254 transitions. [2025-02-05 11:56:59,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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:56:59,551 INFO L276 IsEmpty]: Start isEmpty. Operand 21738 states and 22254 transitions. [2025-02-05 11:56:59,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1620 [2025-02-05 11:56:59,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:56:59,573 INFO L218 NwaCegarLoop]: trace histogram [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, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:59,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 11:56:59,573 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:56:59,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:56:59,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1947701586, now seen corresponding path program 1 times [2025-02-05 11:56:59,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:56:59,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122682574] [2025-02-05 11:56:59,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:56:59,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:56:59,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1619 statements into 1 equivalence classes. [2025-02-05 11:56:59,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1619 of 1619 statements. [2025-02-05 11:56:59,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:56:59,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:01,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6004 backedges. 3912 proven. 0 refuted. 0 times theorem prover too weak. 2092 trivial. 0 not checked. [2025-02-05 11:57:01,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:01,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122682574] [2025-02-05 11:57:01,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122682574] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:01,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:57:01,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 11:57:01,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633945454] [2025-02-05 11:57:01,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:01,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 11:57:01,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:01,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 11:57:01,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:57:01,006 INFO L87 Difference]: Start difference. First operand 21738 states and 22254 transitions. Second operand has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 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:57:02,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:02,207 INFO L93 Difference]: Finished difference Result 42159 states and 43180 transitions. [2025-02-05 11:57:02,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 11:57:02,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 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 1619 [2025-02-05 11:57:02,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:02,230 INFO L225 Difference]: With dead ends: 42159 [2025-02-05 11:57:02,230 INFO L226 Difference]: Without dead ends: 21739 [2025-02-05 11:57:02,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:57:02,243 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 357 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 1816 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 1825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:02,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 576 Invalid, 1825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1816 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 11:57:02,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21739 states. [2025-02-05 11:57:02,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21739 to 21738. [2025-02-05 11:57:02,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21738 states, 21737 states have (on average 1.0233702902884483) internal successors, (22245), 21737 states have internal predecessors, (22245), 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:57:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21738 states to 21738 states and 22245 transitions. [2025-02-05 11:57:02,500 INFO L78 Accepts]: Start accepts. Automaton has 21738 states and 22245 transitions. Word has length 1619 [2025-02-05 11:57:02,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:02,501 INFO L471 AbstractCegarLoop]: Abstraction has 21738 states and 22245 transitions. [2025-02-05 11:57:02,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 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:57:02,501 INFO L276 IsEmpty]: Start isEmpty. Operand 21738 states and 22245 transitions. [2025-02-05 11:57:02,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1629 [2025-02-05 11:57:02,537 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:02,537 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:57:02,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 11:57:02,538 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:02,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:02,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1817552267, now seen corresponding path program 1 times [2025-02-05 11:57:02,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:02,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137155419] [2025-02-05 11:57:02,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:02,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:02,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1628 statements into 1 equivalence classes. [2025-02-05 11:57:02,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1628 of 1628 statements. [2025-02-05 11:57:02,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:02,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:03,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6230 backedges. 3595 proven. 0 refuted. 0 times theorem prover too weak. 2635 trivial. 0 not checked. [2025-02-05 11:57:03,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:03,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137155419] [2025-02-05 11:57:03,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137155419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:03,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:57:03,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:57:03,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681047331] [2025-02-05 11:57:03,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:03,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:57:03,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:03,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:57:03,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:03,738 INFO L87 Difference]: Start difference. First operand 21738 states and 22245 transitions. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 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:57:04,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:04,389 INFO L93 Difference]: Finished difference Result 42487 states and 43495 transitions. [2025-02-05 11:57:04,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:57:04,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 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 1628 [2025-02-05 11:57:04,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:04,409 INFO L225 Difference]: With dead ends: 42487 [2025-02-05 11:57:04,409 INFO L226 Difference]: Without dead ends: 22067 [2025-02-05 11:57:04,421 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:57:04,422 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:04,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 446 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:57:04,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22067 states. [2025-02-05 11:57:04,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22067 to 22067. [2025-02-05 11:57:04,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22067 states, 22066 states have (on average 1.0231577993292849) internal successors, (22577), 22066 states have internal predecessors, (22577), 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:57:04,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22067 states to 22067 states and 22577 transitions. [2025-02-05 11:57:04,581 INFO L78 Accepts]: Start accepts. Automaton has 22067 states and 22577 transitions. Word has length 1628 [2025-02-05 11:57:04,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:04,582 INFO L471 AbstractCegarLoop]: Abstraction has 22067 states and 22577 transitions. [2025-02-05 11:57:04,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 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:57:04,582 INFO L276 IsEmpty]: Start isEmpty. Operand 22067 states and 22577 transitions. [2025-02-05 11:57:04,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1634 [2025-02-05 11:57:04,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:04,600 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 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, 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, 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, 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, 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] [2025-02-05 11:57:04,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 11:57:04,601 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:04,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:04,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1222522300, now seen corresponding path program 1 times [2025-02-05 11:57:04,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:04,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999835477] [2025-02-05 11:57:04,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:04,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:04,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1633 statements into 1 equivalence classes. [2025-02-05 11:57:04,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1633 of 1633 statements. [2025-02-05 11:57:04,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:04,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:05,663 INFO L134 CoverageAnalysis]: Checked inductivity of 5657 backedges. 3753 proven. 0 refuted. 0 times theorem prover too weak. 1904 trivial. 0 not checked. [2025-02-05 11:57:05,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:05,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999835477] [2025-02-05 11:57:05,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999835477] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:05,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:57:05,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:57:05,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030306186] [2025-02-05 11:57:05,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:05,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:57:05,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:05,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:57:05,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:05,665 INFO L87 Difference]: Start difference. First operand 22067 states and 22577 transitions. Second operand has 3 states, 3 states have (on average 244.66666666666666) internal successors, (734), 3 states have internal predecessors, (734), 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:57:06,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:06,292 INFO L93 Difference]: Finished difference Result 42816 states and 43825 transitions. [2025-02-05 11:57:06,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:57:06,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 244.66666666666666) internal successors, (734), 3 states have internal predecessors, (734), 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 1633 [2025-02-05 11:57:06,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:06,311 INFO L225 Difference]: With dead ends: 42816 [2025-02-05 11:57:06,312 INFO L226 Difference]: Without dead ends: 22067 [2025-02-05 11:57:06,325 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:57:06,329 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 65 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:06,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 439 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:57:06,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22067 states. [2025-02-05 11:57:06,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22067 to 22067. [2025-02-05 11:57:06,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22067 states, 22066 states have (on average 1.022885887791172) internal successors, (22571), 22066 states have internal predecessors, (22571), 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:57:06,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22067 states to 22067 states and 22571 transitions. [2025-02-05 11:57:06,514 INFO L78 Accepts]: Start accepts. Automaton has 22067 states and 22571 transitions. Word has length 1633 [2025-02-05 11:57:06,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:06,515 INFO L471 AbstractCegarLoop]: Abstraction has 22067 states and 22571 transitions. [2025-02-05 11:57:06,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.66666666666666) internal successors, (734), 3 states have internal predecessors, (734), 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:57:06,515 INFO L276 IsEmpty]: Start isEmpty. Operand 22067 states and 22571 transitions. [2025-02-05 11:57:06,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1636 [2025-02-05 11:57:06,533 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:06,533 INFO L218 NwaCegarLoop]: trace histogram [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, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 8, 8, 8, 8, 8, 7, 7, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:57:06,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 11:57:06,533 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:06,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:06,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1701364119, now seen corresponding path program 1 times [2025-02-05 11:57:06,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:06,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599834842] [2025-02-05 11:57:06,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:06,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:06,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1635 statements into 1 equivalence classes. [2025-02-05 11:57:06,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1635 of 1635 statements. [2025-02-05 11:57:06,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:06,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:08,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6345 backedges. 2323 proven. 0 refuted. 0 times theorem prover too weak. 4022 trivial. 0 not checked. [2025-02-05 11:57:08,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:08,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599834842] [2025-02-05 11:57:08,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599834842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:08,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:57:08,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 11:57:08,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618578604] [2025-02-05 11:57:08,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:08,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 11:57:08,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:08,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 11:57:08,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:57:08,265 INFO L87 Difference]: Start difference. First operand 22067 states and 22571 transitions. Second operand has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 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:57:09,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:09,550 INFO L93 Difference]: Finished difference Result 45796 states and 46834 transitions. [2025-02-05 11:57:09,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:57:09,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 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 1635 [2025-02-05 11:57:09,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:09,572 INFO L225 Difference]: With dead ends: 45796 [2025-02-05 11:57:09,572 INFO L226 Difference]: Without dead ends: 25028 [2025-02-05 11:57:09,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:57:09,584 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 423 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 2467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:09,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 32 Invalid, 2467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 2317 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 11:57:09,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25028 states. [2025-02-05 11:57:09,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25028 to 21738. [2025-02-05 11:57:09,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21738 states, 21737 states have (on average 1.0223121865942861) internal successors, (22222), 21737 states have internal predecessors, (22222), 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:57:09,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21738 states to 21738 states and 22222 transitions. [2025-02-05 11:57:09,759 INFO L78 Accepts]: Start accepts. Automaton has 21738 states and 22222 transitions. Word has length 1635 [2025-02-05 11:57:09,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:09,760 INFO L471 AbstractCegarLoop]: Abstraction has 21738 states and 22222 transitions. [2025-02-05 11:57:09,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 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:57:09,760 INFO L276 IsEmpty]: Start isEmpty. Operand 21738 states and 22222 transitions. [2025-02-05 11:57:09,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1681 [2025-02-05 11:57:09,778 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:09,778 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:09,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 11:57:09,779 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:09,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:09,780 INFO L85 PathProgramCache]: Analyzing trace with hash 2125458159, now seen corresponding path program 1 times [2025-02-05 11:57:09,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:09,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93476230] [2025-02-05 11:57:09,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:09,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:09,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1680 statements into 1 equivalence classes. [2025-02-05 11:57:09,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1680 of 1680 statements. [2025-02-05 11:57:09,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:09,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5572 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 5383 trivial. 0 not checked. [2025-02-05 11:57:10,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:10,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93476230] [2025-02-05 11:57:10,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93476230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:10,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:57:10,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:57:10,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261276596] [2025-02-05 11:57:10,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:10,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:57:10,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:10,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:57:10,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:10,745 INFO L87 Difference]: Start difference. First operand 21738 states and 22222 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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:57:11,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:11,406 INFO L93 Difference]: Finished difference Result 42158 states and 43115 transitions. [2025-02-05 11:57:11,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:57:11,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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 1680 [2025-02-05 11:57:11,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:11,426 INFO L225 Difference]: With dead ends: 42158 [2025-02-05 11:57:11,426 INFO L226 Difference]: Without dead ends: 21738 [2025-02-05 11:57:11,437 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:57:11,438 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 310 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:11,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 431 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:57:11,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21738 states. [2025-02-05 11:57:11,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21738 to 20751. [2025-02-05 11:57:11,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20751 states, 20750 states have (on average 1.0209638554216867) internal successors, (21185), 20750 states have internal predecessors, (21185), 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:57:11,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20751 states to 20751 states and 21185 transitions. [2025-02-05 11:57:11,617 INFO L78 Accepts]: Start accepts. Automaton has 20751 states and 21185 transitions. Word has length 1680 [2025-02-05 11:57:11,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:11,617 INFO L471 AbstractCegarLoop]: Abstraction has 20751 states and 21185 transitions. [2025-02-05 11:57:11,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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:57:11,618 INFO L276 IsEmpty]: Start isEmpty. Operand 20751 states and 21185 transitions. [2025-02-05 11:57:11,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1881 [2025-02-05 11:57:11,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:11,639 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 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, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:57:11,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 11:57:11,641 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:11,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:11,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1106903392, now seen corresponding path program 1 times [2025-02-05 11:57:11,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:11,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31060566] [2025-02-05 11:57:11,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:11,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:11,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1880 statements into 1 equivalence classes. [2025-02-05 11:57:11,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1880 of 1880 statements. [2025-02-05 11:57:11,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:11,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:12,623 INFO L134 CoverageAnalysis]: Checked inductivity of 7860 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 7633 trivial. 0 not checked. [2025-02-05 11:57:12,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:12,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31060566] [2025-02-05 11:57:12,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31060566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:12,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:57:12,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:57:12,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46809678] [2025-02-05 11:57:12,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:12,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:57:12,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:12,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:57:12,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:57:12,625 INFO L87 Difference]: Start difference. First operand 20751 states and 21185 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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:57:13,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:13,334 INFO L93 Difference]: Finished difference Result 39197 states and 40043 transitions. [2025-02-05 11:57:13,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:57:13,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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 1880 [2025-02-05 11:57:13,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:13,349 INFO L225 Difference]: With dead ends: 39197 [2025-02-05 11:57:13,350 INFO L226 Difference]: Without dead ends: 18119 [2025-02-05 11:57:13,361 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:57:13,362 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 316 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:13,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 422 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:57:13,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18119 states. [2025-02-05 11:57:13,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18119 to 16145. [2025-02-05 11:57:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16145 states, 16144 states have (on average 1.0140609514370664) internal successors, (16371), 16144 states have internal predecessors, (16371), 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:57:13,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16145 states to 16145 states and 16371 transitions. [2025-02-05 11:57:13,481 INFO L78 Accepts]: Start accepts. Automaton has 16145 states and 16371 transitions. Word has length 1880 [2025-02-05 11:57:13,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:13,481 INFO L471 AbstractCegarLoop]: Abstraction has 16145 states and 16371 transitions. [2025-02-05 11:57:13,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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:57:13,482 INFO L276 IsEmpty]: Start isEmpty. Operand 16145 states and 16371 transitions. [2025-02-05 11:57:13,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2087 [2025-02-05 11:57:13,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:13,506 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 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, 7, 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, 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, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:57:13,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 11:57:13,507 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:13,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:13,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1294725327, now seen corresponding path program 1 times [2025-02-05 11:57:13,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:13,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792813149] [2025-02-05 11:57:13,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:13,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:13,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2086 statements into 1 equivalence classes. [2025-02-05 11:57:13,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2086 of 2086 statements. [2025-02-05 11:57:13,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:13,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:16,235 INFO L134 CoverageAnalysis]: Checked inductivity of 8685 backedges. 6461 proven. 41 refuted. 0 times theorem prover too weak. 2183 trivial. 0 not checked. [2025-02-05 11:57:16,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:16,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792813149] [2025-02-05 11:57:16,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792813149] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:57:16,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880159390] [2025-02-05 11:57:16,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:16,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:57:16,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:57:16,238 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:57:16,242 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:57:16,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2086 statements into 1 equivalence classes. [2025-02-05 11:57:16,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2086 of 2086 statements. [2025-02-05 11:57:16,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:16,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:16,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 2413 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:57:16,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:57:17,133 INFO L134 CoverageAnalysis]: Checked inductivity of 8685 backedges. 5119 proven. 0 refuted. 0 times theorem prover too weak. 3566 trivial. 0 not checked. [2025-02-05 11:57:17,134 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:57:17,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880159390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:17,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:57:17,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 11:57:17,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523881107] [2025-02-05 11:57:17,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:17,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:57:17,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:17,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:57:17,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:57:17,135 INFO L87 Difference]: Start difference. First operand 16145 states and 16371 transitions. Second operand has 3 states, 3 states have (on average 254.66666666666666) internal successors, (764), 3 states have internal predecessors, (764), 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:57:17,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:17,889 INFO L93 Difference]: Finished difference Result 28340 states and 28757 transitions. [2025-02-05 11:57:17,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:57:17,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 254.66666666666666) internal successors, (764), 3 states have internal predecessors, (764), 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 2086 [2025-02-05 11:57:17,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:17,904 INFO L225 Difference]: With dead ends: 28340 [2025-02-05 11:57:17,904 INFO L226 Difference]: Without dead ends: 16145 [2025-02-05 11:57:17,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2090 GetRequests, 2086 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:57:17,910 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 122 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:17,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 433 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:57:17,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16145 states. [2025-02-05 11:57:17,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16145 to 16145. [2025-02-05 11:57:18,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16145 states, 16144 states have (on average 1.0135654112983152) internal successors, (16363), 16144 states have internal predecessors, (16363), 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:57:18,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16145 states to 16145 states and 16363 transitions. [2025-02-05 11:57:18,023 INFO L78 Accepts]: Start accepts. Automaton has 16145 states and 16363 transitions. Word has length 2086 [2025-02-05 11:57:18,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:18,024 INFO L471 AbstractCegarLoop]: Abstraction has 16145 states and 16363 transitions. [2025-02-05 11:57:18,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 254.66666666666666) internal successors, (764), 3 states have internal predecessors, (764), 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:57:18,024 INFO L276 IsEmpty]: Start isEmpty. Operand 16145 states and 16363 transitions. [2025-02-05 11:57:18,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2108 [2025-02-05 11:57:18,048 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:18,049 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 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, 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, 7, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 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] [2025-02-05 11:57:18,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 11:57:18,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:57:18,250 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:18,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:18,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1573634402, now seen corresponding path program 1 times [2025-02-05 11:57:18,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:18,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825922873] [2025-02-05 11:57:18,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:18,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:18,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2107 statements into 1 equivalence classes. [2025-02-05 11:57:18,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2107 of 2107 statements. [2025-02-05 11:57:18,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:18,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:20,336 INFO L134 CoverageAnalysis]: Checked inductivity of 8471 backedges. 6019 proven. 153 refuted. 0 times theorem prover too weak. 2299 trivial. 0 not checked. [2025-02-05 11:57:20,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:20,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825922873] [2025-02-05 11:57:20,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825922873] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:57:20,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395641526] [2025-02-05 11:57:20,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:20,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:57:20,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:57:20,343 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:57:20,344 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:57:20,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2107 statements into 1 equivalence classes. [2025-02-05 11:57:20,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2107 of 2107 statements. [2025-02-05 11:57:20,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:20,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:20,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 2428 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:57:20,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:57:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 8471 backedges. 4915 proven. 0 refuted. 0 times theorem prover too weak. 3556 trivial. 0 not checked. [2025-02-05 11:57:21,105 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:57:21,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395641526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:57:21,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:57:21,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 11:57:21,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263475241] [2025-02-05 11:57:21,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:57:21,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:57:21,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:57:21,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:57:21,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:57:21,107 INFO L87 Difference]: Start difference. First operand 16145 states and 16363 transitions. Second operand has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 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:57:21,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:57:21,814 INFO L93 Difference]: Finished difference Result 31630 states and 32094 transitions. [2025-02-05 11:57:21,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:57:21,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 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 2107 [2025-02-05 11:57:21,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:57:21,831 INFO L225 Difference]: With dead ends: 31630 [2025-02-05 11:57:21,832 INFO L226 Difference]: Without dead ends: 19435 [2025-02-05 11:57:21,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2112 GetRequests, 2107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:57:21,842 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 222 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:57:21,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 435 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:57:21,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19435 states. [2025-02-05 11:57:21,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19435 to 18448. [2025-02-05 11:57:21,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18448 states, 18447 states have (on average 1.0134439204206647) internal successors, (18695), 18447 states have internal predecessors, (18695), 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:57:21,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18448 states to 18448 states and 18695 transitions. [2025-02-05 11:57:21,984 INFO L78 Accepts]: Start accepts. Automaton has 18448 states and 18695 transitions. Word has length 2107 [2025-02-05 11:57:21,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:57:21,984 INFO L471 AbstractCegarLoop]: Abstraction has 18448 states and 18695 transitions. [2025-02-05 11:57:21,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 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:57:21,985 INFO L276 IsEmpty]: Start isEmpty. Operand 18448 states and 18695 transitions. [2025-02-05 11:57:22,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2232 [2025-02-05 11:57:22,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:57:22,010 INFO L218 NwaCegarLoop]: trace histogram [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, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 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, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 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, 3, 3, 3, 3, 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] [2025-02-05 11:57:22,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 11:57:22,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-05 11:57:22,215 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:57:22,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:57:22,216 INFO L85 PathProgramCache]: Analyzing trace with hash -570533856, now seen corresponding path program 1 times [2025-02-05 11:57:22,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:57:22,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255086424] [2025-02-05 11:57:22,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:22,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:57:22,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2231 statements into 1 equivalence classes. [2025-02-05 11:57:22,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2231 of 2231 statements. [2025-02-05 11:57:22,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:22,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:24,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9000 backedges. 6466 proven. 153 refuted. 0 times theorem prover too weak. 2381 trivial. 0 not checked. [2025-02-05 11:57:24,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:57:24,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255086424] [2025-02-05 11:57:24,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255086424] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:57:24,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558578756] [2025-02-05 11:57:24,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:57:24,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:57:24,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:57:24,743 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:57:24,744 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:57:24,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2231 statements into 1 equivalence classes. [2025-02-05 11:57:25,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2231 of 2231 statements. [2025-02-05 11:57:25,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:57:25,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:57:25,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 2531 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 11:57:25,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:57:32,711 INFO L134 CoverageAnalysis]: Checked inductivity of 9000 backedges. 5850 proven. 67 refuted. 0 times theorem prover too weak. 3083 trivial. 0 not checked. [2025-02-05 11:57:32,711 INFO L312 TraceCheckSpWp]: Computing backward predicates...