./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label19.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/Problem18_label19.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 bf866e82ccfa9edc467f98983da1defe22311f2c1544dd5c4d747bc8c4f74632 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:18:14,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:18:15,025 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:18:15,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:18:15,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:18:15,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:18:15,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:18:15,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:18:15,052 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:18:15,052 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:18:15,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:18:15,052 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:18:15,052 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:18:15,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:18:15,052 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:18:15,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:18:15,053 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:18:15,053 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:18:15,054 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:18:15,054 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:18:15,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:18:15,054 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:18:15,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:18:15,054 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:18:15,054 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:18:15,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:18:15,054 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:18:15,054 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:18:15,054 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:18:15,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:18:15,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:18:15,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:18:15,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:18:15,054 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:18:15,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:18:15,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:18:15,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:18:15,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:18:15,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:18:15,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:18:15,055 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:18:15,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:18:15,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:18:15,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:18:15,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:18:15,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:18:15,055 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:18:15,055 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:18:15,055 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 -> bf866e82ccfa9edc467f98983da1defe22311f2c1544dd5c4d747bc8c4f74632 [2025-01-09 00:18:15,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:18:15,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:18:15,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:18:15,278 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:18:15,278 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:18:15,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label19.c [2025-01-09 00:18:16,433 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f792bdc0/4db9d95c7df04d059f4b60761030db87/FLAG626e3766f [2025-01-09 00:18:16,822 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:18:16,823 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label19.c [2025-01-09 00:18:16,846 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f792bdc0/4db9d95c7df04d059f4b60761030db87/FLAG626e3766f [2025-01-09 00:18:16,861 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f792bdc0/4db9d95c7df04d059f4b60761030db87 [2025-01-09 00:18:16,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:18:16,864 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:18:16,865 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:18:16,865 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:18:16,869 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:18:16,870 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:18:16" (1/1) ... [2025-01-09 00:18:16,870 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73040acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:16, skipping insertion in model container [2025-01-09 00:18:16,870 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:18:16" (1/1) ... [2025-01-09 00:18:16,944 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:18:17,089 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/Problem18_label19.c[1342,1355] [2025-01-09 00:18:17,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:18:17,506 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:18:17,517 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/Problem18_label19.c[1342,1355] [2025-01-09 00:18:17,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:18:17,740 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:18:17,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:17 WrapperNode [2025-01-09 00:18:17,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:18:17,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:18:17,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:18:17,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:18:17,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:17" (1/1) ... [2025-01-09 00:18:17,786 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:17" (1/1) ... [2025-01-09 00:18:17,941 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2025-01-09 00:18:17,942 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:18:17,942 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:18:17,943 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:18:17,943 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:18:17,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:17" (1/1) ... [2025-01-09 00:18:17,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:17" (1/1) ... [2025-01-09 00:18:17,975 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:17" (1/1) ... [2025-01-09 00:18:18,075 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-01-09 00:18:18,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:17" (1/1) ... [2025-01-09 00:18:18,076 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:17" (1/1) ... [2025-01-09 00:18:18,147 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:17" (1/1) ... [2025-01-09 00:18:18,180 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:17" (1/1) ... [2025-01-09 00:18:18,206 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:17" (1/1) ... [2025-01-09 00:18:18,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:17" (1/1) ... [2025-01-09 00:18:18,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:17" (1/1) ... [2025-01-09 00:18:18,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:18:18,251 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:18:18,251 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:18:18,251 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:18:18,252 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:17" (1/1) ... [2025-01-09 00:18:18,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:18:18,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:18:18,275 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-01-09 00:18:18,277 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-01-09 00:18:18,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:18:18,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:18:18,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:18:18,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:18:18,342 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:18:18,343 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:18:20,907 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2025-01-09 00:18:20,908 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:18:20,938 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:18:20,938 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:18:20,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:18:20 BoogieIcfgContainer [2025-01-09 00:18:20,938 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:18:20,942 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:18:20,942 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:18:20,945 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:18:20,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:18:16" (1/3) ... [2025-01-09 00:18:20,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60bdeb74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:18:20, skipping insertion in model container [2025-01-09 00:18:20,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:18:17" (2/3) ... [2025-01-09 00:18:20,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60bdeb74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:18:20, skipping insertion in model container [2025-01-09 00:18:20,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:18:20" (3/3) ... [2025-01-09 00:18:20,947 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem18_label19.c [2025-01-09 00:18:20,957 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:18:20,958 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label19.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:18:21,013 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:18:21,023 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;@1398a3d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:18:21,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:18:21,029 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 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-01-09 00:18:21,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 00:18:21,032 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:21,032 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:18:21,033 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:21,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:21,036 INFO L85 PathProgramCache]: Analyzing trace with hash 356547156, now seen corresponding path program 1 times [2025-01-09 00:18:21,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:21,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656485496] [2025-01-09 00:18:21,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:21,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:21,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 00:18:21,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 00:18:21,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:21,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:21,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:18:21,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:21,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656485496] [2025-01-09 00:18:21,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656485496] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:21,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:21,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:21,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584995024] [2025-01-09 00:18:21,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:21,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:18:21,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:21,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:18:21,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:18:21,237 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 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 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-01-09 00:18:25,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:25,206 INFO L93 Difference]: Finished difference Result 2910 states and 5656 transitions. [2025-01-09 00:18:25,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:18:25,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2025-01-09 00:18:25,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:25,234 INFO L225 Difference]: With dead ends: 2910 [2025-01-09 00:18:25,236 INFO L226 Difference]: Without dead ends: 2080 [2025-01-09 00:18:25,244 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-01-09 00:18:25,247 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 2216 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 3390 mSolverCounterSat, 1773 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2216 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 5163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1773 IncrementalHoareTripleChecker+Valid, 3390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:25,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2216 Valid, 168 Invalid, 5163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1773 Valid, 3390 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-01-09 00:18:25,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2025-01-09 00:18:25,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 2074. [2025-01-09 00:18:25,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2074 states, 2073 states have (on average 1.5561987457790643) internal successors, (3226), 2073 states have internal predecessors, (3226), 0 states have call successors, (0), 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-01-09 00:18:25,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 3226 transitions. [2025-01-09 00:18:25,339 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 3226 transitions. Word has length 9 [2025-01-09 00:18:25,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:25,339 INFO L471 AbstractCegarLoop]: Abstraction has 2074 states and 3226 transitions. [2025-01-09 00:18:25,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-01-09 00:18:25,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 3226 transitions. [2025-01-09 00:18:25,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 00:18:25,344 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:25,344 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:18:25,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:18:25,345 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:25,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:25,346 INFO L85 PathProgramCache]: Analyzing trace with hash -75612781, now seen corresponding path program 1 times [2025-01-09 00:18:25,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:25,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998845096] [2025-01-09 00:18:25,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:25,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:25,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 00:18:25,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 00:18:25,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:25,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:25,903 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 00:18:25,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:25,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998845096] [2025-01-09 00:18:25,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998845096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:25,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:25,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:25,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576013554] [2025-01-09 00:18:25,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:25,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:18:25,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:25,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:18:25,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:18:25,907 INFO L87 Difference]: Start difference. First operand 2074 states and 3226 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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-01-09 00:18:29,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:29,217 INFO L93 Difference]: Finished difference Result 6906 states and 10879 transitions. [2025-01-09 00:18:29,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:18:29,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 169 [2025-01-09 00:18:29,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:29,232 INFO L225 Difference]: With dead ends: 6906 [2025-01-09 00:18:29,232 INFO L226 Difference]: Without dead ends: 4834 [2025-01-09 00:18:29,235 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-01-09 00:18:29,235 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 1923 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4331 mSolverCounterSat, 628 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1923 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 4959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 628 IncrementalHoareTripleChecker+Valid, 4331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:29,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1923 Valid, 623 Invalid, 4959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [628 Valid, 4331 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-09 00:18:29,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4834 states. [2025-01-09 00:18:29,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4834 to 4144. [2025-01-09 00:18:29,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 4143 states have (on average 1.3405744629495535) internal successors, (5554), 4143 states have internal predecessors, (5554), 0 states have call successors, (0), 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-01-09 00:18:29,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5554 transitions. [2025-01-09 00:18:29,299 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 5554 transitions. Word has length 169 [2025-01-09 00:18:29,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:29,299 INFO L471 AbstractCegarLoop]: Abstraction has 4144 states and 5554 transitions. [2025-01-09 00:18:29,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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-01-09 00:18:29,299 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 5554 transitions. [2025-01-09 00:18:29,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-01-09 00:18:29,303 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:29,303 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:18:29,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:18:29,303 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:29,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:29,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1334633671, now seen corresponding path program 1 times [2025-01-09 00:18:29,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:29,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600697585] [2025-01-09 00:18:29,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:29,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:29,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-01-09 00:18:29,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-01-09 00:18:29,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:29,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:29,631 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:18:29,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:29,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600697585] [2025-01-09 00:18:29,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600697585] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:29,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:29,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:29,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436145305] [2025-01-09 00:18:29,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:29,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:18:29,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:29,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:18:29,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:18:29,636 INFO L87 Difference]: Start difference. First operand 4144 states and 5554 transitions. Second operand has 4 states, 4 states have (on average 64.75) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 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-01-09 00:18:31,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:31,784 INFO L93 Difference]: Finished difference Result 10409 states and 13871 transitions. [2025-01-09 00:18:31,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:18:31,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 259 [2025-01-09 00:18:31,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:31,800 INFO L225 Difference]: With dead ends: 10409 [2025-01-09 00:18:31,800 INFO L226 Difference]: Without dead ends: 6214 [2025-01-09 00:18:31,804 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-01-09 00:18:31,805 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 513 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3037 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 3725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 3037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:31,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 637 Invalid, 3725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 3037 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 00:18:31,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6214 states. [2025-01-09 00:18:31,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6214 to 5524. [2025-01-09 00:18:31,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5524 states, 5523 states have (on average 1.196089082020641) internal successors, (6606), 5523 states have internal predecessors, (6606), 0 states have call successors, (0), 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-01-09 00:18:31,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 6606 transitions. [2025-01-09 00:18:31,876 INFO L78 Accepts]: Start accepts. Automaton has 5524 states and 6606 transitions. Word has length 259 [2025-01-09 00:18:31,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:31,877 INFO L471 AbstractCegarLoop]: Abstraction has 5524 states and 6606 transitions. [2025-01-09 00:18:31,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 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-01-09 00:18:31,877 INFO L276 IsEmpty]: Start isEmpty. Operand 5524 states and 6606 transitions. [2025-01-09 00:18:31,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 892 [2025-01-09 00:18:31,888 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:31,889 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:18:31,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:18:31,889 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:31,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:31,890 INFO L85 PathProgramCache]: Analyzing trace with hash 68886135, now seen corresponding path program 1 times [2025-01-09 00:18:31,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:31,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109387741] [2025-01-09 00:18:31,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:31,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:31,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 891 statements into 1 equivalence classes. [2025-01-09 00:18:32,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 891 of 891 statements. [2025-01-09 00:18:32,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:32,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:32,646 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2025-01-09 00:18:32,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:32,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109387741] [2025-01-09 00:18:32,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109387741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:32,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:32,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:18:32,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828301182] [2025-01-09 00:18:32,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:32,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:32,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:32,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:32,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:32,649 INFO L87 Difference]: Start difference. First operand 5524 states and 6606 transitions. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 2 states have internal predecessors, (527), 0 states have call successors, (0), 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-01-09 00:18:34,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:34,220 INFO L93 Difference]: Finished difference Result 12426 states and 14971 transitions. [2025-01-09 00:18:34,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:34,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 2 states have internal predecessors, (527), 0 states have call successors, (0), 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 891 [2025-01-09 00:18:34,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:34,234 INFO L225 Difference]: With dead ends: 12426 [2025-01-09 00:18:34,235 INFO L226 Difference]: Without dead ends: 6904 [2025-01-09 00:18:34,240 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-01-09 00:18:34,241 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 249 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 687 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 687 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:34,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 77 Invalid, 2478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [687 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:18:34,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6904 states. [2025-01-09 00:18:34,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6904 to 6904. [2025-01-09 00:18:34,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6904 states, 6903 states have (on average 1.192814718238447) internal successors, (8234), 6903 states have internal predecessors, (8234), 0 states have call successors, (0), 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-01-09 00:18:34,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 8234 transitions. [2025-01-09 00:18:34,328 INFO L78 Accepts]: Start accepts. Automaton has 6904 states and 8234 transitions. Word has length 891 [2025-01-09 00:18:34,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:34,330 INFO L471 AbstractCegarLoop]: Abstraction has 6904 states and 8234 transitions. [2025-01-09 00:18:34,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 2 states have internal predecessors, (527), 0 states have call successors, (0), 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-01-09 00:18:34,331 INFO L276 IsEmpty]: Start isEmpty. Operand 6904 states and 8234 transitions. [2025-01-09 00:18:34,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 914 [2025-01-09 00:18:34,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:34,349 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:18:34,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:18:34,349 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:34,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:34,350 INFO L85 PathProgramCache]: Analyzing trace with hash -859536242, now seen corresponding path program 1 times [2025-01-09 00:18:34,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:34,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644284815] [2025-01-09 00:18:34,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:34,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:34,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 913 statements into 1 equivalence classes. [2025-01-09 00:18:34,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 913 of 913 statements. [2025-01-09 00:18:34,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:34,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:35,198 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2025-01-09 00:18:35,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:35,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644284815] [2025-01-09 00:18:35,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644284815] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:35,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:35,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:18:35,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815180246] [2025-01-09 00:18:35,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:35,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:35,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:35,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:35,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:35,204 INFO L87 Difference]: Start difference. First operand 6904 states and 8234 transitions. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 2 states have internal predecessors, (527), 0 states have call successors, (0), 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-01-09 00:18:36,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:36,751 INFO L93 Difference]: Finished difference Result 16566 states and 20399 transitions. [2025-01-09 00:18:36,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:36,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 2 states have internal predecessors, (527), 0 states have call successors, (0), 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 913 [2025-01-09 00:18:36,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:36,783 INFO L225 Difference]: With dead ends: 16566 [2025-01-09 00:18:36,783 INFO L226 Difference]: Without dead ends: 9664 [2025-01-09 00:18:36,790 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-01-09 00:18:36,791 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 226 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:36,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 389 Invalid, 2269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:18:36,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9664 states. [2025-01-09 00:18:36,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9664 to 8974. [2025-01-09 00:18:36,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8974 states, 8973 states have (on average 1.1651621531260448) internal successors, (10455), 8973 states have internal predecessors, (10455), 0 states have call successors, (0), 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-01-09 00:18:36,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8974 states to 8974 states and 10455 transitions. [2025-01-09 00:18:36,909 INFO L78 Accepts]: Start accepts. Automaton has 8974 states and 10455 transitions. Word has length 913 [2025-01-09 00:18:36,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:36,910 INFO L471 AbstractCegarLoop]: Abstraction has 8974 states and 10455 transitions. [2025-01-09 00:18:36,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 2 states have internal predecessors, (527), 0 states have call successors, (0), 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-01-09 00:18:36,911 INFO L276 IsEmpty]: Start isEmpty. Operand 8974 states and 10455 transitions. [2025-01-09 00:18:36,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 978 [2025-01-09 00:18:36,935 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:36,936 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:18:36,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:18:36,938 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:36,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:36,939 INFO L85 PathProgramCache]: Analyzing trace with hash -374228833, now seen corresponding path program 1 times [2025-01-09 00:18:36,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:36,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930822414] [2025-01-09 00:18:36,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:36,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:37,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 977 statements into 1 equivalence classes. [2025-01-09 00:18:37,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 977 of 977 statements. [2025-01-09 00:18:37,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:37,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:38,198 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2025-01-09 00:18:38,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:38,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930822414] [2025-01-09 00:18:38,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930822414] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:38,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:38,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:38,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075465545] [2025-01-09 00:18:38,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:38,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:38,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:38,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:38,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:38,203 INFO L87 Difference]: Start difference. First operand 8974 states and 10455 transitions. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 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-01-09 00:18:39,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:39,530 INFO L93 Difference]: Finished difference Result 17946 states and 20908 transitions. [2025-01-09 00:18:39,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:39,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 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 977 [2025-01-09 00:18:39,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:39,549 INFO L225 Difference]: With dead ends: 17946 [2025-01-09 00:18:39,549 INFO L226 Difference]: Without dead ends: 8974 [2025-01-09 00:18:39,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-01-09 00:18:39,558 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 788 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 2165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:39,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 780 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1974 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:18:39,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8974 states. [2025-01-09 00:18:39,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8974 to 8974. [2025-01-09 00:18:39,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8974 states, 8973 states have (on average 1.1456591998216872) internal successors, (10280), 8973 states have internal predecessors, (10280), 0 states have call successors, (0), 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-01-09 00:18:39,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8974 states to 8974 states and 10280 transitions. [2025-01-09 00:18:39,640 INFO L78 Accepts]: Start accepts. Automaton has 8974 states and 10280 transitions. Word has length 977 [2025-01-09 00:18:39,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:39,641 INFO L471 AbstractCegarLoop]: Abstraction has 8974 states and 10280 transitions. [2025-01-09 00:18:39,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 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-01-09 00:18:39,641 INFO L276 IsEmpty]: Start isEmpty. Operand 8974 states and 10280 transitions. [2025-01-09 00:18:39,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1032 [2025-01-09 00:18:39,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:39,648 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:18:39,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:18:39,648 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:39,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:39,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1211414778, now seen corresponding path program 1 times [2025-01-09 00:18:39,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:39,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342428791] [2025-01-09 00:18:39,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:39,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:39,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1031 statements into 1 equivalence classes. [2025-01-09 00:18:39,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1031 of 1031 statements. [2025-01-09 00:18:39,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:39,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:40,510 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 525 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-01-09 00:18:40,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:40,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342428791] [2025-01-09 00:18:40,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342428791] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:40,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:40,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:40,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459918168] [2025-01-09 00:18:40,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:40,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:40,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:40,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:40,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:40,513 INFO L87 Difference]: Start difference. First operand 8974 states and 10280 transitions. Second operand has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 0 states have call successors, (0), 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-01-09 00:18:42,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:42,034 INFO L93 Difference]: Finished difference Result 24156 states and 27941 transitions. [2025-01-09 00:18:42,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:42,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 0 states have call successors, (0), 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 1031 [2025-01-09 00:18:42,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:42,058 INFO L225 Difference]: With dead ends: 24156 [2025-01-09 00:18:42,058 INFO L226 Difference]: Without dead ends: 15184 [2025-01-09 00:18:42,066 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-01-09 00:18:42,066 INFO L435 NwaCegarLoop]: 1010 mSDtfsCounter, 574 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1985 mSolverCounterSat, 344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 2329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 1985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:42,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 1017 Invalid, 2329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 1985 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:18:42,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15184 states. [2025-01-09 00:18:42,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15184 to 14494. [2025-01-09 00:18:42,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14494 states, 14493 states have (on average 1.1217829296901953) internal successors, (16258), 14493 states have internal predecessors, (16258), 0 states have call successors, (0), 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-01-09 00:18:42,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14494 states to 14494 states and 16258 transitions. [2025-01-09 00:18:42,190 INFO L78 Accepts]: Start accepts. Automaton has 14494 states and 16258 transitions. Word has length 1031 [2025-01-09 00:18:42,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:42,191 INFO L471 AbstractCegarLoop]: Abstraction has 14494 states and 16258 transitions. [2025-01-09 00:18:42,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 0 states have call successors, (0), 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-01-09 00:18:42,191 INFO L276 IsEmpty]: Start isEmpty. Operand 14494 states and 16258 transitions. [2025-01-09 00:18:42,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1067 [2025-01-09 00:18:42,199 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:42,199 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:18:42,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:18:42,200 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:42,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:42,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1253652401, now seen corresponding path program 1 times [2025-01-09 00:18:42,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:42,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146898688] [2025-01-09 00:18:42,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:42,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:42,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1066 statements into 1 equivalence classes. [2025-01-09 00:18:42,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1066 of 1066 statements. [2025-01-09 00:18:42,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:42,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:42,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2025-01-09 00:18:42,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:42,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146898688] [2025-01-09 00:18:42,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146898688] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:42,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:42,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:42,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156571298] [2025-01-09 00:18:42,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:42,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:42,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:42,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:42,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:42,745 INFO L87 Difference]: Start difference. First operand 14494 states and 16258 transitions. Second operand has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 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-01-09 00:18:44,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:44,373 INFO L93 Difference]: Finished difference Result 33816 states and 38324 transitions. [2025-01-09 00:18:44,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:44,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 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 1066 [2025-01-09 00:18:44,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:44,404 INFO L225 Difference]: With dead ends: 33816 [2025-01-09 00:18:44,404 INFO L226 Difference]: Without dead ends: 19324 [2025-01-09 00:18:44,416 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-01-09 00:18:44,417 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 603 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2064 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 2351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 2064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:44,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 413 Invalid, 2351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 2064 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:18:44,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19324 states. [2025-01-09 00:18:44,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19324 to 18634. [2025-01-09 00:18:44,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18634 states, 18633 states have (on average 1.1166210486770782) internal successors, (20806), 18633 states have internal predecessors, (20806), 0 states have call successors, (0), 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-01-09 00:18:44,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18634 states to 18634 states and 20806 transitions. [2025-01-09 00:18:44,669 INFO L78 Accepts]: Start accepts. Automaton has 18634 states and 20806 transitions. Word has length 1066 [2025-01-09 00:18:44,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:44,672 INFO L471 AbstractCegarLoop]: Abstraction has 18634 states and 20806 transitions. [2025-01-09 00:18:44,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 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-01-09 00:18:44,672 INFO L276 IsEmpty]: Start isEmpty. Operand 18634 states and 20806 transitions. [2025-01-09 00:18:44,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1068 [2025-01-09 00:18:44,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:44,681 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:18:44,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:18:44,683 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:44,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:44,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1595140177, now seen corresponding path program 1 times [2025-01-09 00:18:44,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:44,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618616106] [2025-01-09 00:18:44,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:44,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:44,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1067 statements into 1 equivalence classes. [2025-01-09 00:18:44,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1067 of 1067 statements. [2025-01-09 00:18:44,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:44,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:45,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1039 backedges. 367 proven. 0 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2025-01-09 00:18:45,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:45,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618616106] [2025-01-09 00:18:45,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618616106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:45,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:45,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:45,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367452945] [2025-01-09 00:18:45,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:45,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:45,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:45,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:45,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:45,296 INFO L87 Difference]: Start difference. First operand 18634 states and 20806 transitions. Second operand has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 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-01-09 00:18:46,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:46,992 INFO L93 Difference]: Finished difference Result 42096 states and 47515 transitions. [2025-01-09 00:18:46,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:46,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 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 1067 [2025-01-09 00:18:46,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:47,023 INFO L225 Difference]: With dead ends: 42096 [2025-01-09 00:18:47,023 INFO L226 Difference]: Without dead ends: 23464 [2025-01-09 00:18:47,039 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-01-09 00:18:47,039 INFO L435 NwaCegarLoop]: 1034 mSDtfsCounter, 615 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1827 mSolverCounterSat, 519 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 2346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 1827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:47,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1040 Invalid, 2346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [519 Valid, 1827 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:18:47,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23464 states. [2025-01-09 00:18:47,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23464 to 23464. [2025-01-09 00:18:47,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23464 states, 23463 states have (on average 1.1110684908153263) internal successors, (26069), 23463 states have internal predecessors, (26069), 0 states have call successors, (0), 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-01-09 00:18:47,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23464 states to 23464 states and 26069 transitions. [2025-01-09 00:18:47,304 INFO L78 Accepts]: Start accepts. Automaton has 23464 states and 26069 transitions. Word has length 1067 [2025-01-09 00:18:47,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:47,305 INFO L471 AbstractCegarLoop]: Abstraction has 23464 states and 26069 transitions. [2025-01-09 00:18:47,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 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-01-09 00:18:47,305 INFO L276 IsEmpty]: Start isEmpty. Operand 23464 states and 26069 transitions. [2025-01-09 00:18:47,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1085 [2025-01-09 00:18:47,320 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:47,320 INFO L218 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:18:47,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:18:47,321 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:47,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:47,321 INFO L85 PathProgramCache]: Analyzing trace with hash -520976226, now seen corresponding path program 1 times [2025-01-09 00:18:47,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:47,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227933169] [2025-01-09 00:18:47,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:47,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:47,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1084 statements into 1 equivalence classes. [2025-01-09 00:18:47,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1084 of 1084 statements. [2025-01-09 00:18:47,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:47,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:48,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 295 proven. 555 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2025-01-09 00:18:48,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:48,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227933169] [2025-01-09 00:18:48,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227933169] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:18:48,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565799375] [2025-01-09 00:18:48,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:48,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:18:48,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:18:48,301 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-01-09 00:18:48,303 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-01-09 00:18:48,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1084 statements into 1 equivalence classes. [2025-01-09 00:18:48,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1084 of 1084 statements. [2025-01-09 00:18:48,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:48,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:48,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:18:48,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:18:48,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-01-09 00:18:48,701 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:18:48,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565799375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:48,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:18:48,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 00:18:48,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969307460] [2025-01-09 00:18:48,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:48,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:48,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:48,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:48,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:18:48,703 INFO L87 Difference]: Start difference. First operand 23464 states and 26069 transitions. Second operand has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 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-01-09 00:18:50,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:50,185 INFO L93 Difference]: Finished difference Result 55206 states and 61223 transitions. [2025-01-09 00:18:50,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:50,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 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 1084 [2025-01-09 00:18:50,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:50,219 INFO L225 Difference]: With dead ends: 55206 [2025-01-09 00:18:50,219 INFO L226 Difference]: Without dead ends: 26914 [2025-01-09 00:18:50,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1089 GetRequests, 1084 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:18:50,231 INFO L435 NwaCegarLoop]: 967 mSDtfsCounter, 649 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1703 mSolverCounterSat, 508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 2211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 508 IncrementalHoareTripleChecker+Valid, 1703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:50,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 973 Invalid, 2211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [508 Valid, 1703 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:18:50,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26914 states. [2025-01-09 00:18:50,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26914 to 25534. [2025-01-09 00:18:50,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25534 states, 25533 states have (on average 1.0576508831707985) internal successors, (27005), 25533 states have internal predecessors, (27005), 0 states have call successors, (0), 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-01-09 00:18:50,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25534 states to 25534 states and 27005 transitions. [2025-01-09 00:18:50,429 INFO L78 Accepts]: Start accepts. Automaton has 25534 states and 27005 transitions. Word has length 1084 [2025-01-09 00:18:50,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:50,430 INFO L471 AbstractCegarLoop]: Abstraction has 25534 states and 27005 transitions. [2025-01-09 00:18:50,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 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-01-09 00:18:50,430 INFO L276 IsEmpty]: Start isEmpty. Operand 25534 states and 27005 transitions. [2025-01-09 00:18:50,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1227 [2025-01-09 00:18:50,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:50,442 INFO L218 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:18:50,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 00:18:50,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 00:18:50,643 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:50,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:50,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1711715145, now seen corresponding path program 1 times [2025-01-09 00:18:50,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:50,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860894174] [2025-01-09 00:18:50,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:50,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:50,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1226 statements into 1 equivalence classes. [2025-01-09 00:18:50,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1226 of 1226 statements. [2025-01-09 00:18:50,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:50,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:51,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2025-01-09 00:18:51,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:51,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860894174] [2025-01-09 00:18:51,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860894174] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:51,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:51,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:51,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037510012] [2025-01-09 00:18:51,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:51,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:18:51,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:51,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:18:51,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:18:51,681 INFO L87 Difference]: Start difference. First operand 25534 states and 27005 transitions. Second operand has 4 states, 4 states have (on average 207.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 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-01-09 00:18:53,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:53,801 INFO L93 Difference]: Finished difference Result 50376 states and 53317 transitions. [2025-01-09 00:18:53,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:18:53,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 207.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 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 1226 [2025-01-09 00:18:53,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:53,830 INFO L225 Difference]: With dead ends: 50376 [2025-01-09 00:18:53,831 INFO L226 Difference]: Without dead ends: 25534 [2025-01-09 00:18:53,848 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-01-09 00:18:53,849 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 965 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2738 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 3157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 2738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:53,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 114 Invalid, 3157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 2738 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:18:53,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25534 states. [2025-01-09 00:18:54,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25534 to 25534. [2025-01-09 00:18:54,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25534 states, 25533 states have (on average 1.0575333881643363) internal successors, (27002), 25533 states have internal predecessors, (27002), 0 states have call successors, (0), 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-01-09 00:18:54,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25534 states to 25534 states and 27002 transitions. [2025-01-09 00:18:54,097 INFO L78 Accepts]: Start accepts. Automaton has 25534 states and 27002 transitions. Word has length 1226 [2025-01-09 00:18:54,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:54,098 INFO L471 AbstractCegarLoop]: Abstraction has 25534 states and 27002 transitions. [2025-01-09 00:18:54,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 207.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 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-01-09 00:18:54,098 INFO L276 IsEmpty]: Start isEmpty. Operand 25534 states and 27002 transitions. [2025-01-09 00:18:54,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1251 [2025-01-09 00:18:54,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:54,110 INFO L218 NwaCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:18:54,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:18:54,111 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:54,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:54,111 INFO L85 PathProgramCache]: Analyzing trace with hash -2094412914, now seen corresponding path program 1 times [2025-01-09 00:18:54,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:54,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251753525] [2025-01-09 00:18:54,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:54,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:54,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1250 statements into 1 equivalence classes. [2025-01-09 00:18:54,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1250 of 1250 statements. [2025-01-09 00:18:54,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:54,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:54,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1726 backedges. 996 proven. 0 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2025-01-09 00:18:54,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:54,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251753525] [2025-01-09 00:18:54,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251753525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:54,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:54,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:54,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975722266] [2025-01-09 00:18:54,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:54,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:54,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:54,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:54,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:54,570 INFO L87 Difference]: Start difference. First operand 25534 states and 27002 transitions. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 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-01-09 00:18:55,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:55,871 INFO L93 Difference]: Finished difference Result 56586 states and 60213 transitions. [2025-01-09 00:18:55,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:55,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 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 1250 [2025-01-09 00:18:55,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:55,902 INFO L225 Difference]: With dead ends: 56586 [2025-01-09 00:18:55,902 INFO L226 Difference]: Without dead ends: 31054 [2025-01-09 00:18:55,919 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-01-09 00:18:55,920 INFO L435 NwaCegarLoop]: 952 mSDtfsCounter, 582 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:55,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 959 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:18:55,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31054 states. [2025-01-09 00:18:56,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31054 to 31054. [2025-01-09 00:18:56,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31054 states, 31053 states have (on average 1.056580684635945) internal successors, (32810), 31053 states have internal predecessors, (32810), 0 states have call successors, (0), 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-01-09 00:18:56,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31054 states to 31054 states and 32810 transitions. [2025-01-09 00:18:56,139 INFO L78 Accepts]: Start accepts. Automaton has 31054 states and 32810 transitions. Word has length 1250 [2025-01-09 00:18:56,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:56,140 INFO L471 AbstractCegarLoop]: Abstraction has 31054 states and 32810 transitions. [2025-01-09 00:18:56,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 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-01-09 00:18:56,140 INFO L276 IsEmpty]: Start isEmpty. Operand 31054 states and 32810 transitions. [2025-01-09 00:18:56,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1292 [2025-01-09 00:18:56,152 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:56,153 INFO L218 NwaCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:18:56,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:18:56,153 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:56,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:56,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1848215346, now seen corresponding path program 1 times [2025-01-09 00:18:56,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:56,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036145065] [2025-01-09 00:18:56,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:56,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:56,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1291 statements into 1 equivalence classes. [2025-01-09 00:18:56,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1291 of 1291 statements. [2025-01-09 00:18:56,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:56,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1813 backedges. 1044 proven. 0 refuted. 0 times theorem prover too weak. 769 trivial. 0 not checked. [2025-01-09 00:18:56,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:56,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036145065] [2025-01-09 00:18:56,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036145065] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:56,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:56,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:56,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442393214] [2025-01-09 00:18:56,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:56,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:56,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:56,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:56,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:56,639 INFO L87 Difference]: Start difference. First operand 31054 states and 32810 transitions. Second operand has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 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-01-09 00:18:57,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:57,803 INFO L93 Difference]: Finished difference Result 61416 states and 64927 transitions. [2025-01-09 00:18:57,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:57,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 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 1291 [2025-01-09 00:18:57,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:57,834 INFO L225 Difference]: With dead ends: 61416 [2025-01-09 00:18:57,834 INFO L226 Difference]: Without dead ends: 31054 [2025-01-09 00:18:57,852 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-01-09 00:18:57,852 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 522 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1658 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:57,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 931 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1658 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:18:57,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31054 states. [2025-01-09 00:18:58,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31054 to 31054. [2025-01-09 00:18:58,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31054 states, 31053 states have (on average 1.050623128200174) internal successors, (32625), 31053 states have internal predecessors, (32625), 0 states have call successors, (0), 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-01-09 00:18:58,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31054 states to 31054 states and 32625 transitions. [2025-01-09 00:18:58,073 INFO L78 Accepts]: Start accepts. Automaton has 31054 states and 32625 transitions. Word has length 1291 [2025-01-09 00:18:58,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:18:58,074 INFO L471 AbstractCegarLoop]: Abstraction has 31054 states and 32625 transitions. [2025-01-09 00:18:58,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 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-01-09 00:18:58,074 INFO L276 IsEmpty]: Start isEmpty. Operand 31054 states and 32625 transitions. [2025-01-09 00:18:58,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1306 [2025-01-09 00:18:58,087 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:18:58,087 INFO L218 NwaCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:18:58,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:18:58,087 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:18:58,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:18:58,088 INFO L85 PathProgramCache]: Analyzing trace with hash 716938357, now seen corresponding path program 1 times [2025-01-09 00:18:58,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:18:58,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283309667] [2025-01-09 00:18:58,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:18:58,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:18:58,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1305 statements into 1 equivalence classes. [2025-01-09 00:18:58,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1305 of 1305 statements. [2025-01-09 00:18:58,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:18:58,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:18:58,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2025-01-09 00:18:58,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:18:58,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283309667] [2025-01-09 00:18:58,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283309667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:18:58,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:18:58,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:18:58,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555360879] [2025-01-09 00:18:58,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:18:58,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:18:58,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:18:58,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:18:58,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:18:58,598 INFO L87 Difference]: Start difference. First operand 31054 states and 32625 transitions. Second operand has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 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-01-09 00:18:59,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:18:59,865 INFO L93 Difference]: Finished difference Result 61416 states and 64554 transitions. [2025-01-09 00:18:59,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:18:59,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 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 1305 [2025-01-09 00:18:59,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:18:59,897 INFO L225 Difference]: With dead ends: 61416 [2025-01-09 00:18:59,897 INFO L226 Difference]: Without dead ends: 30364 [2025-01-09 00:18:59,917 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-01-09 00:18:59,918 INFO L435 NwaCegarLoop]: 954 mSDtfsCounter, 605 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1793 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 2021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:18:59,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 961 Invalid, 2021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1793 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:18:59,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30364 states. [2025-01-09 00:19:00,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30364 to 28984. [2025-01-09 00:19:00,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28984 states, 28983 states have (on average 1.0406100127661042) internal successors, (30160), 28983 states have internal predecessors, (30160), 0 states have call successors, (0), 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-01-09 00:19:00,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28984 states to 28984 states and 30160 transitions. [2025-01-09 00:19:00,151 INFO L78 Accepts]: Start accepts. Automaton has 28984 states and 30160 transitions. Word has length 1305 [2025-01-09 00:19:00,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:00,152 INFO L471 AbstractCegarLoop]: Abstraction has 28984 states and 30160 transitions. [2025-01-09 00:19:00,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 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-01-09 00:19:00,152 INFO L276 IsEmpty]: Start isEmpty. Operand 28984 states and 30160 transitions. [2025-01-09 00:19:00,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1372 [2025-01-09 00:19:00,167 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:00,168 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:19:00,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:19:00,168 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:00,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:00,169 INFO L85 PathProgramCache]: Analyzing trace with hash 802610490, now seen corresponding path program 1 times [2025-01-09 00:19:00,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:00,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923858148] [2025-01-09 00:19:00,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:00,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:00,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1371 statements into 1 equivalence classes. [2025-01-09 00:19:00,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1371 of 1371 statements. [2025-01-09 00:19:00,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:00,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:01,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2270 backedges. 1473 proven. 614 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2025-01-09 00:19:01,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:01,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923858148] [2025-01-09 00:19:01,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923858148] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:19:01,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986976957] [2025-01-09 00:19:01,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:01,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:19:01,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:19:01,293 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-01-09 00:19:01,294 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-01-09 00:19:01,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1371 statements into 1 equivalence classes. [2025-01-09 00:19:01,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1371 of 1371 statements. [2025-01-09 00:19:01,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:01,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:01,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 1601 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:19:01,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:19:01,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2270 backedges. 1485 proven. 0 refuted. 0 times theorem prover too weak. 785 trivial. 0 not checked. [2025-01-09 00:19:01,641 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:19:01,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986976957] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:01,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:19:01,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-01-09 00:19:01,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110375468] [2025-01-09 00:19:01,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:01,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:19:01,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:01,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:19:01,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:19:01,643 INFO L87 Difference]: Start difference. First operand 28984 states and 30160 transitions. Second operand has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 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-01-09 00:19:02,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:02,983 INFO L93 Difference]: Finished difference Result 70386 states and 73400 transitions. [2025-01-09 00:19:02,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:19:02,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 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 1371 [2025-01-09 00:19:02,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:03,024 INFO L225 Difference]: With dead ends: 70386 [2025-01-09 00:19:03,024 INFO L226 Difference]: Without dead ends: 42094 [2025-01-09 00:19:03,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1377 GetRequests, 1371 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:19:03,111 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 644 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:03,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 135 Invalid, 1945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1725 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:19:03,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42094 states. [2025-01-09 00:19:03,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42094 to 41404. [2025-01-09 00:19:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41404 states, 41403 states have (on average 1.0323164988044344) internal successors, (42741), 41403 states have internal predecessors, (42741), 0 states have call successors, (0), 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-01-09 00:19:03,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41404 states to 41404 states and 42741 transitions. [2025-01-09 00:19:03,546 INFO L78 Accepts]: Start accepts. Automaton has 41404 states and 42741 transitions. Word has length 1371 [2025-01-09 00:19:03,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:03,547 INFO L471 AbstractCegarLoop]: Abstraction has 41404 states and 42741 transitions. [2025-01-09 00:19:03,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 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-01-09 00:19:03,547 INFO L276 IsEmpty]: Start isEmpty. Operand 41404 states and 42741 transitions. [2025-01-09 00:19:03,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1418 [2025-01-09 00:19:03,578 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:03,578 INFO L218 NwaCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:19:03,585 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-01-09 00:19:03,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 00:19:03,779 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:03,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:03,780 INFO L85 PathProgramCache]: Analyzing trace with hash -804279411, now seen corresponding path program 1 times [2025-01-09 00:19:03,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:03,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626797432] [2025-01-09 00:19:03,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:03,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:03,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1417 statements into 1 equivalence classes. [2025-01-09 00:19:03,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1417 of 1417 statements. [2025-01-09 00:19:03,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:03,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:04,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2155 backedges. 599 proven. 887 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2025-01-09 00:19:04,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:04,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626797432] [2025-01-09 00:19:04,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626797432] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:19:04,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44764943] [2025-01-09 00:19:04,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:04,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:19:04,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:19:04,947 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-01-09 00:19:04,947 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-01-09 00:19:05,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1417 statements into 1 equivalence classes. [2025-01-09 00:19:05,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1417 of 1417 statements. [2025-01-09 00:19:05,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:05,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:05,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 1629 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:19:05,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:19:05,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2155 backedges. 788 proven. 0 refuted. 0 times theorem prover too weak. 1367 trivial. 0 not checked. [2025-01-09 00:19:05,382 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:19:05,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44764943] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:05,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:19:05,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 00:19:05,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012529149] [2025-01-09 00:19:05,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:05,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:19:05,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:05,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:19:05,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:19:05,384 INFO L87 Difference]: Start difference. First operand 41404 states and 42741 transitions. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 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-01-09 00:19:06,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:06,609 INFO L93 Difference]: Finished difference Result 82116 states and 84789 transitions. [2025-01-09 00:19:06,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:19:06,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 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 1417 [2025-01-09 00:19:06,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:06,648 INFO L225 Difference]: With dead ends: 82116 [2025-01-09 00:19:06,648 INFO L226 Difference]: Without dead ends: 41404 [2025-01-09 00:19:06,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1422 GetRequests, 1417 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:19:06,674 INFO L435 NwaCegarLoop]: 936 mSDtfsCounter, 504 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 1800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:06,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 943 Invalid, 1800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1676 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:19:06,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41404 states. [2025-01-09 00:19:06,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41404 to 41404. [2025-01-09 00:19:06,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41404 states, 41403 states have (on average 1.0280897519503418) internal successors, (42566), 41403 states have internal predecessors, (42566), 0 states have call successors, (0), 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-01-09 00:19:06,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41404 states to 41404 states and 42566 transitions. [2025-01-09 00:19:06,977 INFO L78 Accepts]: Start accepts. Automaton has 41404 states and 42566 transitions. Word has length 1417 [2025-01-09 00:19:06,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:06,978 INFO L471 AbstractCegarLoop]: Abstraction has 41404 states and 42566 transitions. [2025-01-09 00:19:06,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 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-01-09 00:19:06,978 INFO L276 IsEmpty]: Start isEmpty. Operand 41404 states and 42566 transitions. [2025-01-09 00:19:06,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1432 [2025-01-09 00:19:06,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:06,995 INFO L218 NwaCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:19:07,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 00:19:07,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:19:07,196 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:07,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:07,197 INFO L85 PathProgramCache]: Analyzing trace with hash -68005168, now seen corresponding path program 1 times [2025-01-09 00:19:07,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:07,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95086315] [2025-01-09 00:19:07,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:07,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:07,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1431 statements into 1 equivalence classes. [2025-01-09 00:19:07,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1431 of 1431 statements. [2025-01-09 00:19:07,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:07,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:08,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2203 backedges. 612 proven. 1317 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-01-09 00:19:08,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:08,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95086315] [2025-01-09 00:19:08,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95086315] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:19:08,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792200125] [2025-01-09 00:19:08,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:08,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:19:08,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:19:08,416 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-01-09 00:19:08,417 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-01-09 00:19:08,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1431 statements into 1 equivalence classes. [2025-01-09 00:19:08,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1431 of 1431 statements. [2025-01-09 00:19:08,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:08,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:08,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 1640 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:19:08,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:19:08,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2203 backedges. 798 proven. 0 refuted. 0 times theorem prover too weak. 1405 trivial. 0 not checked. [2025-01-09 00:19:08,830 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:19:08,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792200125] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:08,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:19:08,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-01-09 00:19:08,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635666387] [2025-01-09 00:19:08,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:08,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:19:08,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:08,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:19:08,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:19:08,832 INFO L87 Difference]: Start difference. First operand 41404 states and 42566 transitions. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 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-01-09 00:19:10,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:10,168 INFO L93 Difference]: Finished difference Result 91086 states and 93939 transitions. [2025-01-09 00:19:10,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:19:10,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 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 1431 [2025-01-09 00:19:10,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:10,219 INFO L225 Difference]: With dead ends: 91086 [2025-01-09 00:19:10,219 INFO L226 Difference]: Without dead ends: 50374 [2025-01-09 00:19:10,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1437 GetRequests, 1431 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:19:10,243 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 517 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:10,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 218 Invalid, 1906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:19:10,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50374 states. [2025-01-09 00:19:10,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50374 to 48304. [2025-01-09 00:19:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48304 states, 48303 states have (on average 1.0271825766515537) internal successors, (49616), 48303 states have internal predecessors, (49616), 0 states have call successors, (0), 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-01-09 00:19:10,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48304 states to 48304 states and 49616 transitions. [2025-01-09 00:19:10,633 INFO L78 Accepts]: Start accepts. Automaton has 48304 states and 49616 transitions. Word has length 1431 [2025-01-09 00:19:10,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:10,634 INFO L471 AbstractCegarLoop]: Abstraction has 48304 states and 49616 transitions. [2025-01-09 00:19:10,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 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-01-09 00:19:10,634 INFO L276 IsEmpty]: Start isEmpty. Operand 48304 states and 49616 transitions. [2025-01-09 00:19:10,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1457 [2025-01-09 00:19:10,653 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:10,653 INFO L218 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:19:10,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 00:19:10,854 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,SelfDestructingSolverStorable16 [2025-01-09 00:19:10,854 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:10,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:10,855 INFO L85 PathProgramCache]: Analyzing trace with hash 388329087, now seen corresponding path program 1 times [2025-01-09 00:19:10,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:10,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340518667] [2025-01-09 00:19:10,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:10,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:10,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1456 statements into 1 equivalence classes. [2025-01-09 00:19:10,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1456 of 1456 statements. [2025-01-09 00:19:10,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:10,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:11,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1899 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1865 trivial. 0 not checked. [2025-01-09 00:19:11,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:11,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340518667] [2025-01-09 00:19:11,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340518667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:11,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:19:11,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:19:11,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721891989] [2025-01-09 00:19:11,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:11,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:19:11,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:11,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:19:11,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:19:11,670 INFO L87 Difference]: Start difference. First operand 48304 states and 49616 transitions. Second operand has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 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-01-09 00:19:12,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:12,470 INFO L93 Difference]: Finished difference Result 49001 states and 50313 transitions. [2025-01-09 00:19:12,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:19:12,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 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 1456 [2025-01-09 00:19:12,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:12,513 INFO L225 Difference]: With dead ends: 49001 [2025-01-09 00:19:12,513 INFO L226 Difference]: Without dead ends: 48304 [2025-01-09 00:19:12,524 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-01-09 00:19:12,524 INFO L435 NwaCegarLoop]: 981 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:12,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 988 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:19:12,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48304 states. [2025-01-09 00:19:12,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48304 to 48304. [2025-01-09 00:19:13,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48304 states, 48303 states have (on average 1.0270997660600791) internal successors, (49612), 48303 states have internal predecessors, (49612), 0 states have call successors, (0), 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-01-09 00:19:13,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48304 states to 48304 states and 49612 transitions. [2025-01-09 00:19:13,088 INFO L78 Accepts]: Start accepts. Automaton has 48304 states and 49612 transitions. Word has length 1456 [2025-01-09 00:19:13,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:13,088 INFO L471 AbstractCegarLoop]: Abstraction has 48304 states and 49612 transitions. [2025-01-09 00:19:13,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 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-01-09 00:19:13,089 INFO L276 IsEmpty]: Start isEmpty. Operand 48304 states and 49612 transitions. [2025-01-09 00:19:13,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1616 [2025-01-09 00:19:13,116 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:13,117 INFO L218 NwaCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:19:13,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:19:13,117 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:13,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:13,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1022357182, now seen corresponding path program 1 times [2025-01-09 00:19:13,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:13,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007328697] [2025-01-09 00:19:13,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:13,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:13,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1615 statements into 1 equivalence classes. [2025-01-09 00:19:13,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1615 of 1615 statements. [2025-01-09 00:19:13,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:13,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:13,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 1779 proven. 0 refuted. 0 times theorem prover too weak. 763 trivial. 0 not checked. [2025-01-09 00:19:13,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:13,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007328697] [2025-01-09 00:19:13,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007328697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:13,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:19:13,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:19:13,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217909531] [2025-01-09 00:19:13,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:13,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:19:13,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:13,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:19:13,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:19:13,836 INFO L87 Difference]: Start difference. First operand 48304 states and 49612 transitions. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 0 states have call successors, (0), 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-01-09 00:19:15,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:15,390 INFO L93 Difference]: Finished difference Result 122826 states and 126325 transitions. [2025-01-09 00:19:15,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:19:15,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 0 states have call successors, (0), 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 1615 [2025-01-09 00:19:15,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:15,448 INFO L225 Difference]: With dead ends: 122826 [2025-01-09 00:19:15,449 INFO L226 Difference]: Without dead ends: 75214 [2025-01-09 00:19:15,463 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-01-09 00:19:15,464 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 615 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1746 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 1999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:15,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 234 Invalid, 1999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1746 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:19:15,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75214 states. [2025-01-09 00:19:15,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75214 to 75214. [2025-01-09 00:19:15,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75214 states, 75213 states have (on average 1.0245037427040538) internal successors, (77056), 75213 states have internal predecessors, (77056), 0 states have call successors, (0), 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-01-09 00:19:16,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75214 states to 75214 states and 77056 transitions. [2025-01-09 00:19:16,049 INFO L78 Accepts]: Start accepts. Automaton has 75214 states and 77056 transitions. Word has length 1615 [2025-01-09 00:19:16,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:16,049 INFO L471 AbstractCegarLoop]: Abstraction has 75214 states and 77056 transitions. [2025-01-09 00:19:16,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 0 states have call successors, (0), 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-01-09 00:19:16,049 INFO L276 IsEmpty]: Start isEmpty. Operand 75214 states and 77056 transitions. [2025-01-09 00:19:16,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1669 [2025-01-09 00:19:16,077 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:16,077 INFO L218 NwaCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:19:16,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 00:19:16,077 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:16,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:16,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1322234343, now seen corresponding path program 1 times [2025-01-09 00:19:16,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:16,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831213856] [2025-01-09 00:19:16,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:16,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:16,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1668 statements into 1 equivalence classes. [2025-01-09 00:19:16,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1668 of 1668 statements. [2025-01-09 00:19:16,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:16,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:18,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2786 backedges. 2072 proven. 351 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2025-01-09 00:19:18,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:18,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831213856] [2025-01-09 00:19:18,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831213856] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:19:18,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132023570] [2025-01-09 00:19:18,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:18,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:19:18,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:19:18,175 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-01-09 00:19:18,177 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-01-09 00:19:18,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1668 statements into 1 equivalence classes. [2025-01-09 00:19:18,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1668 of 1668 statements. [2025-01-09 00:19:18,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:18,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:18,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 1883 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:19:18,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:19:19,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2786 backedges. 1988 proven. 0 refuted. 0 times theorem prover too weak. 798 trivial. 0 not checked. [2025-01-09 00:19:19,557 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:19:19,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132023570] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:19,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:19:19,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-01-09 00:19:19,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561935610] [2025-01-09 00:19:19,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:19,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:19:19,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:19,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:19:19,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:19:19,561 INFO L87 Difference]: Start difference. First operand 75214 states and 77056 transitions. Second operand has 4 states, 4 states have (on average 254.75) internal successors, (1019), 3 states have internal predecessors, (1019), 0 states have call successors, (0), 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-01-09 00:19:21,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:21,785 INFO L93 Difference]: Finished difference Result 164916 states and 169195 transitions. [2025-01-09 00:19:21,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:19:21,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 254.75) internal successors, (1019), 3 states have internal predecessors, (1019), 0 states have call successors, (0), 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 1668 [2025-01-09 00:19:21,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:21,874 INFO L225 Difference]: With dead ends: 164916 [2025-01-09 00:19:21,874 INFO L226 Difference]: Without dead ends: 90394 [2025-01-09 00:19:21,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1674 GetRequests, 1666 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:19:21,922 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 791 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2643 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 3001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 2643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:21,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 65 Invalid, 3001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 2643 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:19:21,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90394 states. [2025-01-09 00:19:22,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90394 to 89014. [2025-01-09 00:19:22,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89014 states, 89013 states have (on average 1.0259175626032153) internal successors, (91320), 89013 states have internal predecessors, (91320), 0 states have call successors, (0), 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-01-09 00:19:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89014 states to 89014 states and 91320 transitions. [2025-01-09 00:19:22,687 INFO L78 Accepts]: Start accepts. Automaton has 89014 states and 91320 transitions. Word has length 1668 [2025-01-09 00:19:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:22,687 INFO L471 AbstractCegarLoop]: Abstraction has 89014 states and 91320 transitions. [2025-01-09 00:19:22,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 254.75) internal successors, (1019), 3 states have internal predecessors, (1019), 0 states have call successors, (0), 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-01-09 00:19:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 89014 states and 91320 transitions. [2025-01-09 00:19:22,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1714 [2025-01-09 00:19:22,718 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:22,718 INFO L218 NwaCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:19:22,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 00:19:22,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:19:22,923 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:22,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:22,924 INFO L85 PathProgramCache]: Analyzing trace with hash 954621892, now seen corresponding path program 1 times [2025-01-09 00:19:22,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:22,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328269508] [2025-01-09 00:19:22,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:22,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:22,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1713 statements into 1 equivalence classes. [2025-01-09 00:19:23,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1713 of 1713 statements. [2025-01-09 00:19:23,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:23,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:23,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3198 backedges. 1892 proven. 0 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2025-01-09 00:19:23,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:23,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328269508] [2025-01-09 00:19:23,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328269508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:23,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:19:23,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:19:23,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170342911] [2025-01-09 00:19:23,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:23,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:19:23,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:23,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:19:23,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:19:23,983 INFO L87 Difference]: Start difference. First operand 89014 states and 91320 transitions. Second operand has 3 states, 3 states have (on average 326.6666666666667) internal successors, (980), 3 states have internal predecessors, (980), 0 states have call successors, (0), 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-01-09 00:19:25,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:25,696 INFO L93 Difference]: Finished difference Result 193206 states and 198389 transitions. [2025-01-09 00:19:25,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:19:25,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 326.6666666666667) internal successors, (980), 3 states have internal predecessors, (980), 0 states have call successors, (0), 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 1713 [2025-01-09 00:19:25,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:25,798 INFO L225 Difference]: With dead ends: 193206 [2025-01-09 00:19:25,798 INFO L226 Difference]: Without dead ends: 104884 [2025-01-09 00:19:25,850 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-01-09 00:19:25,851 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 475 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1781 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 2012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 1781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:25,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 196 Invalid, 2012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 1781 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:19:25,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104884 states. [2025-01-09 00:19:26,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104884 to 95914. [2025-01-09 00:19:26,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95914 states, 95913 states have (on average 1.0264719068322334) internal successors, (98452), 95913 states have internal predecessors, (98452), 0 states have call successors, (0), 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-01-09 00:19:26,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95914 states to 95914 states and 98452 transitions. [2025-01-09 00:19:26,895 INFO L78 Accepts]: Start accepts. Automaton has 95914 states and 98452 transitions. Word has length 1713 [2025-01-09 00:19:26,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:26,896 INFO L471 AbstractCegarLoop]: Abstraction has 95914 states and 98452 transitions. [2025-01-09 00:19:26,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 326.6666666666667) internal successors, (980), 3 states have internal predecessors, (980), 0 states have call successors, (0), 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-01-09 00:19:26,896 INFO L276 IsEmpty]: Start isEmpty. Operand 95914 states and 98452 transitions. [2025-01-09 00:19:26,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1772 [2025-01-09 00:19:26,933 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:26,934 INFO L218 NwaCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:19:26,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 00:19:26,934 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:26,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:26,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1892017963, now seen corresponding path program 1 times [2025-01-09 00:19:26,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:26,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875461312] [2025-01-09 00:19:26,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:26,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:27,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1771 statements into 1 equivalence classes. [2025-01-09 00:19:27,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1771 of 1771 statements. [2025-01-09 00:19:27,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:27,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:29,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3261 backedges. 984 proven. 1702 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-01-09 00:19:29,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:29,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875461312] [2025-01-09 00:19:29,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875461312] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:19:29,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507604075] [2025-01-09 00:19:29,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:29,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:19:29,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:19:29,138 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-01-09 00:19:29,139 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-01-09 00:19:29,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1771 statements into 1 equivalence classes. [2025-01-09 00:19:29,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1771 of 1771 statements. [2025-01-09 00:19:29,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:29,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:29,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 1988 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 00:19:29,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:19:32,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3261 backedges. 984 proven. 1702 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-01-09 00:19:32,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:19:33,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3261 backedges. 2229 proven. 457 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-01-09 00:19:33,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507604075] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:19:33,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:19:33,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-01-09 00:19:33,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160605997] [2025-01-09 00:19:33,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:19:33,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 00:19:33,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:33,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 00:19:33,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2025-01-09 00:19:33,804 INFO L87 Difference]: Start difference. First operand 95914 states and 98452 transitions. Second operand has 16 states, 16 states have (on average 217.125) internal successors, (3474), 16 states have internal predecessors, (3474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)