./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label30.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem16_label30.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 12d23798e1ec2473ce2c19acb587b0594ab921b365483c260e8791dd4e57612e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:58:35,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:58:35,283 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:58:35,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:58:35,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:58:35,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:58:35,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:58:35,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:58:35,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:58:35,315 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:58:35,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:58:35,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:58:35,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:58:35,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:58:35,315 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:58:35,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:58:35,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:58:35,315 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:58:35,315 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:58:35,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:58:35,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:58:35,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:58:35,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:58:35,316 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:58:35,316 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:58:35,316 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:58:35,316 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:58:35,316 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:58:35,316 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:58:35,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:58:35,316 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:58:35,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:58:35,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:58:35,316 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:58:35,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:58:35,316 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:58:35,316 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:58:35,316 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:58:35,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:58:35,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:58:35,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:58:35,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:58:35,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:58:35,317 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 -> 12d23798e1ec2473ce2c19acb587b0594ab921b365483c260e8791dd4e57612e [2025-02-05 11:58:35,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:58:35,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:58:35,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:58:35,572 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:58:35,573 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:58:35,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label30.c [2025-02-05 11:58:36,727 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a16e991b/b543e05f855148b187ba7a4315254e5f/FLAGaf321e9b5 [2025-02-05 11:58:37,041 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:58:37,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label30.c [2025-02-05 11:58:37,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a16e991b/b543e05f855148b187ba7a4315254e5f/FLAGaf321e9b5 [2025-02-05 11:58:37,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a16e991b/b543e05f855148b187ba7a4315254e5f [2025-02-05 11:58:37,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:58:37,080 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:58:37,081 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:58:37,082 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:58:37,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:58:37,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:58:37" (1/1) ... [2025-02-05 11:58:37,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f54dce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:37, skipping insertion in model container [2025-02-05 11:58:37,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:58:37" (1/1) ... [2025-02-05 11:58:37,129 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:58:37,238 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label30.c[1812,1825] [2025-02-05 11:58:37,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:58:37,472 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:58:37,485 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label30.c[1812,1825] [2025-02-05 11:58:37,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:58:37,608 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:58:37,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:37 WrapperNode [2025-02-05 11:58:37,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:58:37,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:58:37,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:58:37,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:58:37,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:37" (1/1) ... [2025-02-05 11:58:37,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:37" (1/1) ... [2025-02-05 11:58:37,752 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-02-05 11:58:37,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:58:37,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:58:37,754 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:58:37,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:58:37,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:37" (1/1) ... [2025-02-05 11:58:37,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:37" (1/1) ... [2025-02-05 11:58:37,779 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:37" (1/1) ... [2025-02-05 11:58:37,861 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 11:58:37,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:37" (1/1) ... [2025-02-05 11:58:37,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:37" (1/1) ... [2025-02-05 11:58:37,907 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:37" (1/1) ... [2025-02-05 11:58:37,913 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:37" (1/1) ... [2025-02-05 11:58:37,921 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:37" (1/1) ... [2025-02-05 11:58:37,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:37" (1/1) ... [2025-02-05 11:58:37,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:58:37,942 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:58:37,942 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:58:37,942 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:58:37,943 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:37" (1/1) ... [2025-02-05 11:58:37,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:58:37,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:58:37,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 11:58:37,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 11:58:37,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:58:37,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:58:37,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:58:37,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:58:38,045 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:58:38,046 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:58:39,585 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-02-05 11:58:39,658 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-02-05 11:58:39,658 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:58:39,684 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:58:39,684 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:58:39,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:58:39 BoogieIcfgContainer [2025-02-05 11:58:39,685 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:58:39,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:58:39,687 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:58:39,690 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:58:39,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:58:37" (1/3) ... [2025-02-05 11:58:39,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e16d55e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:58:39, skipping insertion in model container [2025-02-05 11:58:39,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:37" (2/3) ... [2025-02-05 11:58:39,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e16d55e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:58:39, skipping insertion in model container [2025-02-05 11:58:39,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:58:39" (3/3) ... [2025-02-05 11:58:39,692 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label30.c [2025-02-05 11:58:39,702 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:58:39,707 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label30.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:58:39,766 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:58:39,776 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;@3b4ce65b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:58:39,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:58:39,780 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:39,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-05 11:58:39,784 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:39,784 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:58:39,784 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:39,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:39,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1305868051, now seen corresponding path program 1 times [2025-02-05 11:58:39,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:39,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897130443] [2025-02-05 11:58:39,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:39,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:39,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-05 11:58:39,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-05 11:58:39,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:39,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:39,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:58:39,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:39,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897130443] [2025-02-05 11:58:39,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897130443] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:39,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:58:39,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:58:39,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002073240] [2025-02-05 11:58:39,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:39,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:58:39,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:40,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:58:40,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:40,011 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:41,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:41,519 INFO L93 Difference]: Finished difference Result 1137 states and 2115 transitions. [2025-02-05 11:58:41,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:58:41,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2025-02-05 11:58:41,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:41,530 INFO L225 Difference]: With dead ends: 1137 [2025-02-05 11:58:41,530 INFO L226 Difference]: Without dead ends: 662 [2025-02-05 11:58:41,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:41,538 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 369 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:41,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 114 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 11:58:41,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-02-05 11:58:41,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-02-05 11:58:41,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.7004538577912254) internal successors, (1124), 661 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:41,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1124 transitions. [2025-02-05 11:58:41,589 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1124 transitions. Word has length 15 [2025-02-05 11:58:41,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:41,590 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1124 transitions. [2025-02-05 11:58:41,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:41,590 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1124 transitions. [2025-02-05 11:58:41,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 11:58:41,591 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:41,591 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 11:58:41,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:58:41,592 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:41,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:41,592 INFO L85 PathProgramCache]: Analyzing trace with hash -342609893, now seen corresponding path program 1 times [2025-02-05 11:58:41,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:41,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754317875] [2025-02-05 11:58:41,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:41,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:41,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 11:58:41,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 11:58:41,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:41,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:41,762 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:58:41,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:41,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754317875] [2025-02-05 11:58:41,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754317875] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:41,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:58:41,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:58:41,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707741302] [2025-02-05 11:58:41,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:41,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:58:41,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:41,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:58:41,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:41,764 INFO L87 Difference]: Start difference. First operand 662 states and 1124 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:42,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:42,754 INFO L93 Difference]: Finished difference Result 1980 states and 3367 transitions. [2025-02-05 11:58:42,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:58:42,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-02-05 11:58:42,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:42,759 INFO L225 Difference]: With dead ends: 1980 [2025-02-05 11:58:42,759 INFO L226 Difference]: Without dead ends: 1320 [2025-02-05 11:58:42,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:42,762 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 293 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:42,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 218 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:58:42,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-02-05 11:58:42,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2025-02-05 11:58:42,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.4556482183472328) internal successors, (1920), 1319 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:42,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1920 transitions. [2025-02-05 11:58:42,794 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1920 transitions. Word has length 81 [2025-02-05 11:58:42,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:42,795 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1920 transitions. [2025-02-05 11:58:42,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:42,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1920 transitions. [2025-02-05 11:58:42,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 11:58:42,797 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:42,797 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:58:42,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:58:42,797 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:42,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:42,797 INFO L85 PathProgramCache]: Analyzing trace with hash -560786722, now seen corresponding path program 1 times [2025-02-05 11:58:42,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:42,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012219925] [2025-02-05 11:58:42,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:42,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:42,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 11:58:42,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 11:58:42,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:42,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:43,019 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:58:43,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:43,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012219925] [2025-02-05 11:58:43,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012219925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:43,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:58:43,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:58:43,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573798503] [2025-02-05 11:58:43,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:43,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:58:43,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:43,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:58:43,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:58:43,021 INFO L87 Difference]: Start difference. First operand 1320 states and 1920 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:44,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:44,688 INFO L93 Difference]: Finished difference Result 4283 states and 6144 transitions. [2025-02-05 11:58:44,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:58:44,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-02-05 11:58:44,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:44,698 INFO L225 Difference]: With dead ends: 4283 [2025-02-05 11:58:44,698 INFO L226 Difference]: Without dead ends: 2965 [2025-02-05 11:58:44,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:58:44,703 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 886 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 2071 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 2275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 2071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:44,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 150 Invalid, 2275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 2071 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 11:58:44,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2025-02-05 11:58:44,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2965. [2025-02-05 11:58:44,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2964 states have (on average 1.3670715249662617) internal successors, (4052), 2964 states have internal predecessors, (4052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:44,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 4052 transitions. [2025-02-05 11:58:44,755 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 4052 transitions. Word has length 94 [2025-02-05 11:58:44,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:44,756 INFO L471 AbstractCegarLoop]: Abstraction has 2965 states and 4052 transitions. [2025-02-05 11:58:44,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:44,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 4052 transitions. [2025-02-05 11:58:44,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-02-05 11:58:44,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:44,763 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:58:44,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:58:44,763 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:44,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:44,764 INFO L85 PathProgramCache]: Analyzing trace with hash -876805447, now seen corresponding path program 1 times [2025-02-05 11:58:44,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:44,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150986987] [2025-02-05 11:58:44,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:44,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:44,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-05 11:58:44,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-05 11:58:44,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:44,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:44,985 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-02-05 11:58:44,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:44,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150986987] [2025-02-05 11:58:44,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150986987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:44,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:58:44,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:58:44,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675204330] [2025-02-05 11:58:44,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:44,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:58:44,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:44,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:58:44,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:44,987 INFO L87 Difference]: Start difference. First operand 2965 states and 4052 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:45,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:45,998 INFO L93 Difference]: Finished difference Result 8231 states and 11469 transitions. [2025-02-05 11:58:45,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:58:45,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 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 181 [2025-02-05 11:58:45,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:46,013 INFO L225 Difference]: With dead ends: 8231 [2025-02-05 11:58:46,013 INFO L226 Difference]: Without dead ends: 5597 [2025-02-05 11:58:46,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:46,017 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:46,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 155 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 11:58:46,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2025-02-05 11:58:46,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 4281. [2025-02-05 11:58:46,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4281 states, 4280 states have (on average 1.3133177570093457) internal successors, (5621), 4280 states have internal predecessors, (5621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:46,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 5621 transitions. [2025-02-05 11:58:46,102 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 5621 transitions. Word has length 181 [2025-02-05 11:58:46,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:46,103 INFO L471 AbstractCegarLoop]: Abstraction has 4281 states and 5621 transitions. [2025-02-05 11:58:46,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:46,104 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 5621 transitions. [2025-02-05 11:58:46,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-05 11:58:46,108 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:46,108 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:58:46,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:58:46,108 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:46,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:46,109 INFO L85 PathProgramCache]: Analyzing trace with hash 252811406, now seen corresponding path program 1 times [2025-02-05 11:58:46,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:46,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319074867] [2025-02-05 11:58:46,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:46,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:46,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 11:58:46,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 11:58:46,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:46,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:46,283 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 11:58:46,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:46,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319074867] [2025-02-05 11:58:46,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319074867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:46,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:58:46,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:58:46,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002477142] [2025-02-05 11:58:46,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:46,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:58:46,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:46,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:58:46,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:46,286 INFO L87 Difference]: Start difference. First operand 4281 states and 5621 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:47,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:47,132 INFO L93 Difference]: Finished difference Result 9547 states and 12468 transitions. [2025-02-05 11:58:47,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:58:47,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 212 [2025-02-05 11:58:47,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:47,145 INFO L225 Difference]: With dead ends: 9547 [2025-02-05 11:58:47,145 INFO L226 Difference]: Without dead ends: 5597 [2025-02-05 11:58:47,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:47,149 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 277 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:47,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 84 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:58:47,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2025-02-05 11:58:47,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 5597. [2025-02-05 11:58:47,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5597 states, 5596 states have (on average 1.2162258756254467) internal successors, (6806), 5596 states have internal predecessors, (6806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 6806 transitions. [2025-02-05 11:58:47,216 INFO L78 Accepts]: Start accepts. Automaton has 5597 states and 6806 transitions. Word has length 212 [2025-02-05 11:58:47,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:47,217 INFO L471 AbstractCegarLoop]: Abstraction has 5597 states and 6806 transitions. [2025-02-05 11:58:47,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:47,217 INFO L276 IsEmpty]: Start isEmpty. Operand 5597 states and 6806 transitions. [2025-02-05 11:58:47,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-02-05 11:58:47,220 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:47,220 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:58:47,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:58:47,220 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:47,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:47,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1318781256, now seen corresponding path program 1 times [2025-02-05 11:58:47,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:47,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008576880] [2025-02-05 11:58:47,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:47,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:47,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-02-05 11:58:47,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-02-05 11:58:47,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:47,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:47,676 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:58:47,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:47,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008576880] [2025-02-05 11:58:47,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008576880] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:47,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:58:47,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 11:58:47,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256818025] [2025-02-05 11:58:47,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:47,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 11:58:47,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:47,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 11:58:47,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:58:47,679 INFO L87 Difference]: Start difference. First operand 5597 states and 6806 transitions. Second operand has 7 states, 7 states have (on average 49.57142857142857) internal successors, (347), 6 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:48,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:48,851 INFO L93 Difference]: Finished difference Result 10722 states and 13122 transitions. [2025-02-05 11:58:48,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 11:58:48,852 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 49.57142857142857) internal successors, (347), 6 states have internal predecessors, (347), 0 states have call successors, (0), 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 347 [2025-02-05 11:58:48,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:48,863 INFO L225 Difference]: With dead ends: 10722 [2025-02-05 11:58:48,863 INFO L226 Difference]: Without dead ends: 5268 [2025-02-05 11:58:48,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:58:48,868 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 308 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1870 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 1870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:48,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 291 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 1870 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 11:58:48,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5268 states. [2025-02-05 11:58:48,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5268 to 5268. [2025-02-05 11:58:48,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5268 states, 5267 states have (on average 1.0924625023732675) internal successors, (5754), 5267 states have internal predecessors, (5754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:48,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5268 states to 5268 states and 5754 transitions. [2025-02-05 11:58:48,951 INFO L78 Accepts]: Start accepts. Automaton has 5268 states and 5754 transitions. Word has length 347 [2025-02-05 11:58:48,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:48,951 INFO L471 AbstractCegarLoop]: Abstraction has 5268 states and 5754 transitions. [2025-02-05 11:58:48,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 49.57142857142857) internal successors, (347), 6 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:48,952 INFO L276 IsEmpty]: Start isEmpty. Operand 5268 states and 5754 transitions. [2025-02-05 11:58:48,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-02-05 11:58:48,958 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:48,958 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:58:48,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:58:48,959 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:48,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:48,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2118114353, now seen corresponding path program 1 times [2025-02-05 11:58:48,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:48,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996640986] [2025-02-05 11:58:48,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:48,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:49,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-02-05 11:58:49,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-02-05 11:58:49,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:49,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:49,354 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-02-05 11:58:49,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:49,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996640986] [2025-02-05 11:58:49,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996640986] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:58:49,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997967719] [2025-02-05 11:58:49,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:49,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:58:49,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:58:49,356 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:58:49,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 11:58:49,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-02-05 11:58:49,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-02-05 11:58:49,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:49,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:49,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:58:49,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:58:49,867 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-02-05 11:58:49,867 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:58:49,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997967719] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:49,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:58:49,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-02-05 11:58:49,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441546015] [2025-02-05 11:58:49,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:49,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:58:49,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:49,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:58:49,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:58:49,869 INFO L87 Difference]: Start difference. First operand 5268 states and 5754 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 2 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:50,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:50,548 INFO L93 Difference]: Finished difference Result 6257 states and 6773 transitions. [2025-02-05 11:58:50,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:58:50,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 2 states have internal predecessors, (248), 0 states have call successors, (0), 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 354 [2025-02-05 11:58:50,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:50,564 INFO L225 Difference]: With dead ends: 6257 [2025-02-05 11:58:50,567 INFO L226 Difference]: Without dead ends: 6255 [2025-02-05 11:58:50,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:58:50,568 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 108 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:50,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 83 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:58:50,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6255 states. [2025-02-05 11:58:50,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6255 to 5597. [2025-02-05 11:58:50,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5597 states, 5596 states have (on average 1.089349535382416) internal successors, (6096), 5596 states have internal predecessors, (6096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:50,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 6096 transitions. [2025-02-05 11:58:50,635 INFO L78 Accepts]: Start accepts. Automaton has 5597 states and 6096 transitions. Word has length 354 [2025-02-05 11:58:50,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:50,635 INFO L471 AbstractCegarLoop]: Abstraction has 5597 states and 6096 transitions. [2025-02-05 11:58:50,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 2 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:50,635 INFO L276 IsEmpty]: Start isEmpty. Operand 5597 states and 6096 transitions. [2025-02-05 11:58:50,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2025-02-05 11:58:50,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:50,643 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:58:50,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 11:58:50,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:58:50,843 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:50,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:50,844 INFO L85 PathProgramCache]: Analyzing trace with hash -297626484, now seen corresponding path program 1 times [2025-02-05 11:58:50,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:50,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139724901] [2025-02-05 11:58:50,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:50,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:50,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-02-05 11:58:50,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-02-05 11:58:50,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:50,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:51,168 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-02-05 11:58:51,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:51,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139724901] [2025-02-05 11:58:51,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139724901] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:51,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:58:51,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:58:51,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781786862] [2025-02-05 11:58:51,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:51,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:58:51,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:51,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:58:51,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:51,171 INFO L87 Difference]: Start difference. First operand 5597 states and 6096 transitions. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:51,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:51,885 INFO L93 Difference]: Finished difference Result 13824 states and 15194 transitions. [2025-02-05 11:58:51,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:58:51,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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 553 [2025-02-05 11:58:51,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:51,899 INFO L225 Difference]: With dead ends: 13824 [2025-02-05 11:58:51,899 INFO L226 Difference]: Without dead ends: 8558 [2025-02-05 11:58:51,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:51,904 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 221 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:51,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 432 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:58:51,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8558 states. [2025-02-05 11:58:52,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8558 to 8558. [2025-02-05 11:58:52,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8558 states, 8557 states have (on average 1.065794086712633) internal successors, (9120), 8557 states have internal predecessors, (9120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:52,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8558 states to 8558 states and 9120 transitions. [2025-02-05 11:58:52,026 INFO L78 Accepts]: Start accepts. Automaton has 8558 states and 9120 transitions. Word has length 553 [2025-02-05 11:58:52,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:52,026 INFO L471 AbstractCegarLoop]: Abstraction has 8558 states and 9120 transitions. [2025-02-05 11:58:52,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:52,031 INFO L276 IsEmpty]: Start isEmpty. Operand 8558 states and 9120 transitions. [2025-02-05 11:58:52,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2025-02-05 11:58:52,042 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:52,043 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:58:52,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:58:52,043 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:52,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:52,044 INFO L85 PathProgramCache]: Analyzing trace with hash 440673345, now seen corresponding path program 1 times [2025-02-05 11:58:52,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:52,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466343514] [2025-02-05 11:58:52,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:52,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:52,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 587 statements into 1 equivalence classes. [2025-02-05 11:58:52,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 587 of 587 statements. [2025-02-05 11:58:52,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:52,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:52,360 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 537 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-02-05 11:58:52,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:52,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466343514] [2025-02-05 11:58:52,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466343514] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:52,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:58:52,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:58:52,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234632597] [2025-02-05 11:58:52,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:52,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:58:52,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:52,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:58:52,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:52,364 INFO L87 Difference]: Start difference. First operand 8558 states and 9120 transitions. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:53,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:53,139 INFO L93 Difference]: Finished difference Result 19417 states and 20888 transitions. [2025-02-05 11:58:53,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:58:53,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 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 587 [2025-02-05 11:58:53,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:53,156 INFO L225 Difference]: With dead ends: 19417 [2025-02-05 11:58:53,156 INFO L226 Difference]: Without dead ends: 11190 [2025-02-05 11:58:53,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:53,164 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 176 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:53,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 420 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:58:53,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11190 states. [2025-02-05 11:58:53,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11190 to 10861. [2025-02-05 11:58:53,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10861 states, 10860 states have (on average 1.0615101289134439) internal successors, (11528), 10860 states have internal predecessors, (11528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:53,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 11528 transitions. [2025-02-05 11:58:53,274 INFO L78 Accepts]: Start accepts. Automaton has 10861 states and 11528 transitions. Word has length 587 [2025-02-05 11:58:53,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:53,274 INFO L471 AbstractCegarLoop]: Abstraction has 10861 states and 11528 transitions. [2025-02-05 11:58:53,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:53,275 INFO L276 IsEmpty]: Start isEmpty. Operand 10861 states and 11528 transitions. [2025-02-05 11:58:53,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2025-02-05 11:58:53,288 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:53,288 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:58:53,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:58:53,288 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:53,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:53,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1848066072, now seen corresponding path program 1 times [2025-02-05 11:58:53,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:53,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916459842] [2025-02-05 11:58:53,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:53,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:53,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 746 statements into 1 equivalence classes. [2025-02-05 11:58:53,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 746 of 746 statements. [2025-02-05 11:58:53,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:53,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:53,658 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 602 proven. 0 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-02-05 11:58:53,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:53,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916459842] [2025-02-05 11:58:53,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916459842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:53,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:58:53,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:58:53,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85509684] [2025-02-05 11:58:53,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:53,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:58:53,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:53,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:58:53,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:53,660 INFO L87 Difference]: Start difference. First operand 10861 states and 11528 transitions. Second operand has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:54,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:54,332 INFO L93 Difference]: Finished difference Result 24352 states and 26058 transitions. [2025-02-05 11:58:54,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:58:54,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 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 746 [2025-02-05 11:58:54,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:54,351 INFO L225 Difference]: With dead ends: 24352 [2025-02-05 11:58:54,351 INFO L226 Difference]: Without dead ends: 13822 [2025-02-05 11:58:54,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:54,361 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 220 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:54,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 440 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:58:54,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13822 states. [2025-02-05 11:58:54,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13822 to 13164. [2025-02-05 11:58:54,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13163 states have (on average 1.055382511585505) internal successors, (13892), 13163 states have internal predecessors, (13892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:54,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13892 transitions. [2025-02-05 11:58:54,477 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 13892 transitions. Word has length 746 [2025-02-05 11:58:54,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:54,479 INFO L471 AbstractCegarLoop]: Abstraction has 13164 states and 13892 transitions. [2025-02-05 11:58:54,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:54,479 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 13892 transitions. [2025-02-05 11:58:54,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2025-02-05 11:58:54,486 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:54,487 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:58:54,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:58:54,488 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:54,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:54,488 INFO L85 PathProgramCache]: Analyzing trace with hash -25065326, now seen corresponding path program 1 times [2025-02-05 11:58:54,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:54,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659159144] [2025-02-05 11:58:54,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:54,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:54,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 747 statements into 1 equivalence classes. [2025-02-05 11:58:54,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 747 of 747 statements. [2025-02-05 11:58:54,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:54,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:54,871 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2025-02-05 11:58:54,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:54,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659159144] [2025-02-05 11:58:54,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659159144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:54,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:58:54,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:58:54,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915238313] [2025-02-05 11:58:54,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:54,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:58:54,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:54,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:58:54,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:54,874 INFO L87 Difference]: Start difference. First operand 13164 states and 13892 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:55,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:55,521 INFO L93 Difference]: Finished difference Result 27971 states and 29467 transitions. [2025-02-05 11:58:55,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:58:55,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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 747 [2025-02-05 11:58:55,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:55,544 INFO L225 Difference]: With dead ends: 27971 [2025-02-05 11:58:55,544 INFO L226 Difference]: Without dead ends: 13164 [2025-02-05 11:58:55,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:55,557 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 270 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:55,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 430 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:58:55,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2025-02-05 11:58:55,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 12835. [2025-02-05 11:58:55,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12835 states, 12834 states have (on average 1.0365435561788998) internal successors, (13303), 12834 states have internal predecessors, (13303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:55,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12835 states to 12835 states and 13303 transitions. [2025-02-05 11:58:55,665 INFO L78 Accepts]: Start accepts. Automaton has 12835 states and 13303 transitions. Word has length 747 [2025-02-05 11:58:55,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:55,666 INFO L471 AbstractCegarLoop]: Abstraction has 12835 states and 13303 transitions. [2025-02-05 11:58:55,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:55,666 INFO L276 IsEmpty]: Start isEmpty. Operand 12835 states and 13303 transitions. [2025-02-05 11:58:55,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1031 [2025-02-05 11:58:55,679 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:55,680 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:58:55,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:58:55,681 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:55,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:55,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1708320584, now seen corresponding path program 1 times [2025-02-05 11:58:55,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:55,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145895232] [2025-02-05 11:58:55,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:55,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:55,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1030 statements into 1 equivalence classes. [2025-02-05 11:58:55,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1030 of 1030 statements. [2025-02-05 11:58:55,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:55,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:56,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1632 backedges. 996 proven. 0 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2025-02-05 11:58:56,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:56,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145895232] [2025-02-05 11:58:56,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145895232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:56,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:58:56,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:58:56,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870997802] [2025-02-05 11:58:56,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:56,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:58:56,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:56,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:58:56,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:58:56,699 INFO L87 Difference]: Start difference. First operand 12835 states and 13303 transitions. Second operand has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:57,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:57,472 INFO L93 Difference]: Finished difference Result 25348 states and 26282 transitions. [2025-02-05 11:58:57,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 11:58:57,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 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 1030 [2025-02-05 11:58:57,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:57,489 INFO L225 Difference]: With dead ends: 25348 [2025-02-05 11:58:57,489 INFO L226 Difference]: Without dead ends: 12844 [2025-02-05 11:58:57,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:58:57,499 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:57,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 444 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:58:57,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12844 states. [2025-02-05 11:58:57,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12844 to 12506. [2025-02-05 11:58:57,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12506 states, 12505 states have (on average 1.0367852858856457) internal successors, (12965), 12505 states have internal predecessors, (12965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:57,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 12965 transitions. [2025-02-05 11:58:57,595 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 12965 transitions. Word has length 1030 [2025-02-05 11:58:57,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:57,596 INFO L471 AbstractCegarLoop]: Abstraction has 12506 states and 12965 transitions. [2025-02-05 11:58:57,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:57,596 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 12965 transitions. [2025-02-05 11:58:57,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1088 [2025-02-05 11:58:57,608 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:57,608 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:58:57,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:58:57,609 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:57,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:57,610 INFO L85 PathProgramCache]: Analyzing trace with hash -291685421, now seen corresponding path program 1 times [2025-02-05 11:58:57,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:57,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096192827] [2025-02-05 11:58:57,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:57,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:57,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1087 statements into 1 equivalence classes. [2025-02-05 11:58:57,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1087 of 1087 statements. [2025-02-05 11:58:57,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:57,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:58,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2483 backedges. 1725 proven. 0 refuted. 0 times theorem prover too weak. 758 trivial. 0 not checked. [2025-02-05 11:58:58,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:58,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096192827] [2025-02-05 11:58:58,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096192827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:58,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:58:58,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:58:58,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095660592] [2025-02-05 11:58:58,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:58,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:58:58,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:58,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:58:58,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:58,267 INFO L87 Difference]: Start difference. First operand 12506 states and 12965 transitions. Second operand has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:58,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:58:58,878 INFO L93 Difference]: Finished difference Result 24681 states and 25597 transitions. [2025-02-05 11:58:58,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:58:58,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 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 1087 [2025-02-05 11:58:58,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:58:58,891 INFO L225 Difference]: With dead ends: 24681 [2025-02-05 11:58:58,891 INFO L226 Difference]: Without dead ends: 12506 [2025-02-05 11:58:58,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:58,900 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 193 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:58:58,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 422 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:58:58,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12506 states. [2025-02-05 11:58:59,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12506 to 11848. [2025-02-05 11:58:59,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11848 states, 11847 states have (on average 1.0233814467797755) internal successors, (12124), 11847 states have internal predecessors, (12124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:59,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 12124 transitions. [2025-02-05 11:58:59,039 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 12124 transitions. Word has length 1087 [2025-02-05 11:58:59,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:58:59,039 INFO L471 AbstractCegarLoop]: Abstraction has 11848 states and 12124 transitions. [2025-02-05 11:58:59,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:58:59,039 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 12124 transitions. [2025-02-05 11:58:59,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1113 [2025-02-05 11:58:59,051 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:58:59,051 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:58:59,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 11:58:59,051 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:58:59,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:58:59,052 INFO L85 PathProgramCache]: Analyzing trace with hash -579573430, now seen corresponding path program 1 times [2025-02-05 11:58:59,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:58:59,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918464821] [2025-02-05 11:58:59,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:58:59,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:58:59,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1112 statements into 1 equivalence classes. [2025-02-05 11:58:59,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1112 of 1112 statements. [2025-02-05 11:58:59,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:58:59,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:58:59,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2633 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1310 trivial. 0 not checked. [2025-02-05 11:58:59,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:58:59,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918464821] [2025-02-05 11:58:59,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918464821] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:58:59,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:58:59,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:58:59,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637944246] [2025-02-05 11:58:59,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:58:59,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:58:59,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:58:59,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:58:59,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:58:59,807 INFO L87 Difference]: Start difference. First operand 11848 states and 12124 transitions. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:00,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:59:00,337 INFO L93 Difference]: Finished difference Result 24023 states and 24584 transitions. [2025-02-05 11:59:00,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:59:00,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 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 1112 [2025-02-05 11:59:00,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:59:00,350 INFO L225 Difference]: With dead ends: 24023 [2025-02-05 11:59:00,350 INFO L226 Difference]: Without dead ends: 12506 [2025-02-05 11:59:00,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:59:00,361 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:59:00,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 438 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:59:00,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12506 states. [2025-02-05 11:59:00,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12506 to 12506. [2025-02-05 11:59:00,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12506 states, 12505 states have (on average 1.0225509796081567) internal successors, (12787), 12505 states have internal predecessors, (12787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:00,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 12787 transitions. [2025-02-05 11:59:00,456 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 12787 transitions. Word has length 1112 [2025-02-05 11:59:00,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:59:00,457 INFO L471 AbstractCegarLoop]: Abstraction has 12506 states and 12787 transitions. [2025-02-05 11:59:00,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:00,457 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 12787 transitions. [2025-02-05 11:59:00,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1167 [2025-02-05 11:59:00,470 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:59:00,470 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:59:00,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 11:59:00,471 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:59:00,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:59:00,471 INFO L85 PathProgramCache]: Analyzing trace with hash -98349195, now seen corresponding path program 1 times [2025-02-05 11:59:00,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:59:00,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011650771] [2025-02-05 11:59:00,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:00,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:59:00,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1166 statements into 1 equivalence classes. [2025-02-05 11:59:00,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1166 of 1166 statements. [2025-02-05 11:59:00,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:00,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:00,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 774 proven. 0 refuted. 0 times theorem prover too weak. 1813 trivial. 0 not checked. [2025-02-05 11:59:00,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:59:00,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011650771] [2025-02-05 11:59:00,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011650771] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:59:00,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:59:00,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:59:00,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712920269] [2025-02-05 11:59:00,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:59:00,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:59:00,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:59:00,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:59:00,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:59:00,945 INFO L87 Difference]: Start difference. First operand 12506 states and 12787 transitions. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:01,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:59:01,482 INFO L93 Difference]: Finished difference Result 27313 states and 27961 transitions. [2025-02-05 11:59:01,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:59:01,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 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 1166 [2025-02-05 11:59:01,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:59:01,494 INFO L225 Difference]: With dead ends: 27313 [2025-02-05 11:59:01,494 INFO L226 Difference]: Without dead ends: 13493 [2025-02-05 11:59:01,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:59:01,502 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 209 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:59:01,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 410 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:59:01,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2025-02-05 11:59:01,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 12177. [2025-02-05 11:59:01,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12177 states, 12176 states have (on average 1.0198751642575559) internal successors, (12418), 12176 states have internal predecessors, (12418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:01,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 12418 transitions. [2025-02-05 11:59:01,591 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 12418 transitions. Word has length 1166 [2025-02-05 11:59:01,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:59:01,592 INFO L471 AbstractCegarLoop]: Abstraction has 12177 states and 12418 transitions. [2025-02-05 11:59:01,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:01,592 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 12418 transitions. [2025-02-05 11:59:01,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1247 [2025-02-05 11:59:01,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:59:01,605 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:59:01,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 11:59:01,605 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:59:01,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:59:01,625 INFO L85 PathProgramCache]: Analyzing trace with hash 486108221, now seen corresponding path program 1 times [2025-02-05 11:59:01,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:59:01,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967134186] [2025-02-05 11:59:01,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:01,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:59:01,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1246 statements into 1 equivalence classes. [2025-02-05 11:59:01,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1246 of 1246 statements. [2025-02-05 11:59:01,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:01,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:02,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2827 backedges. 1955 proven. 66 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked. [2025-02-05 11:59:02,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:59:02,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967134186] [2025-02-05 11:59:02,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967134186] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:59:02,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684486630] [2025-02-05 11:59:02,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:02,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:59:02,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:59:02,627 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:59:02,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 11:59:02,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1246 statements into 1 equivalence classes. [2025-02-05 11:59:02,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1246 of 1246 statements. [2025-02-05 11:59:02,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:02,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:02,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 1452 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 11:59:02,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:59:05,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2827 backedges. 1502 proven. 201 refuted. 0 times theorem prover too weak. 1124 trivial. 0 not checked. [2025-02-05 11:59:05,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:59:08,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2827 backedges. 1502 proven. 201 refuted. 0 times theorem prover too weak. 1124 trivial. 0 not checked. [2025-02-05 11:59:08,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684486630] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:59:08,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:59:08,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-02-05 11:59:08,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679467008] [2025-02-05 11:59:08,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:59:08,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 11:59:08,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:59:08,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 11:59:08,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:59:08,133 INFO L87 Difference]: Start difference. First operand 12177 states and 12418 transitions. Second operand has 9 states, 9 states have (on average 189.44444444444446) internal successors, (1705), 8 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:11,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:59:11,659 INFO L93 Difference]: Finished difference Result 35867 states and 36577 transitions. [2025-02-05 11:59:11,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 11:59:11,660 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 189.44444444444446) internal successors, (1705), 8 states have internal predecessors, (1705), 0 states have call successors, (0), 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 1246 [2025-02-05 11:59:11,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:59:11,680 INFO L225 Difference]: With dead ends: 35867 [2025-02-05 11:59:11,681 INFO L226 Difference]: Without dead ends: 24021 [2025-02-05 11:59:11,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2502 GetRequests, 2487 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-02-05 11:59:11,692 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1503 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6808 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 7049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 6808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:59:11,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 94 Invalid, 7049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 6808 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-05 11:59:11,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24021 states. [2025-02-05 11:59:11,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24021 to 17770. [2025-02-05 11:59:11,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17770 states, 17769 states have (on average 1.0190781698463616) internal successors, (18108), 17769 states have internal predecessors, (18108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:11,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17770 states to 17770 states and 18108 transitions. [2025-02-05 11:59:11,897 INFO L78 Accepts]: Start accepts. Automaton has 17770 states and 18108 transitions. Word has length 1246 [2025-02-05 11:59:11,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:59:11,897 INFO L471 AbstractCegarLoop]: Abstraction has 17770 states and 18108 transitions. [2025-02-05 11:59:11,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 189.44444444444446) internal successors, (1705), 8 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:11,898 INFO L276 IsEmpty]: Start isEmpty. Operand 17770 states and 18108 transitions. [2025-02-05 11:59:11,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1277 [2025-02-05 11:59:11,914 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:59:11,915 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-02-05 11:59:11,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 11:59:12,115 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,SelfDestructingSolverStorable15 [2025-02-05 11:59:12,115 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:59:12,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:59:12,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1214826409, now seen corresponding path program 1 times [2025-02-05 11:59:12,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:59:12,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975555218] [2025-02-05 11:59:12,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:12,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:59:12,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1276 statements into 1 equivalence classes. [2025-02-05 11:59:12,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1276 of 1276 statements. [2025-02-05 11:59:12,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:12,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:12,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3386 backedges. 1757 proven. 0 refuted. 0 times theorem prover too weak. 1629 trivial. 0 not checked. [2025-02-05 11:59:12,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:59:12,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975555218] [2025-02-05 11:59:12,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975555218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:59:12,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:59:12,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:59:12,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023437375] [2025-02-05 11:59:12,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:59:12,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:59:12,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:59:12,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:59:12,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:59:12,999 INFO L87 Difference]: Start difference. First operand 17770 states and 18108 transitions. Second operand has 4 states, 4 states have (on average 161.75) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:13,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:59:13,690 INFO L93 Difference]: Finished difference Result 35538 states and 36217 transitions. [2025-02-05 11:59:13,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:59:13,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 161.75) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 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 1276 [2025-02-05 11:59:13,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:59:13,706 INFO L225 Difference]: With dead ends: 35538 [2025-02-05 11:59:13,706 INFO L226 Difference]: Without dead ends: 18099 [2025-02-05 11:59:13,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:59:13,718 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 173 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:59:13,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 103 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:59:13,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18099 states. [2025-02-05 11:59:13,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18099 to 18099. [2025-02-05 11:59:13,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18099 states, 18098 states have (on average 1.0188418609791137) internal successors, (18439), 18098 states have internal predecessors, (18439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:13,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18099 states to 18099 states and 18439 transitions. [2025-02-05 11:59:13,850 INFO L78 Accepts]: Start accepts. Automaton has 18099 states and 18439 transitions. Word has length 1276 [2025-02-05 11:59:13,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:59:13,851 INFO L471 AbstractCegarLoop]: Abstraction has 18099 states and 18439 transitions. [2025-02-05 11:59:13,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 161.75) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:13,851 INFO L276 IsEmpty]: Start isEmpty. Operand 18099 states and 18439 transitions. [2025-02-05 11:59:13,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1340 [2025-02-05 11:59:13,867 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:59:13,868 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-02-05 11:59:13,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 11:59:13,868 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:59:13,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:59:13,869 INFO L85 PathProgramCache]: Analyzing trace with hash -102573253, now seen corresponding path program 1 times [2025-02-05 11:59:13,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:59:13,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663930396] [2025-02-05 11:59:13,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:13,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:59:13,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1339 statements into 1 equivalence classes. [2025-02-05 11:59:13,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1339 of 1339 statements. [2025-02-05 11:59:13,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:13,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:14,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3568 backedges. 2265 proven. 0 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2025-02-05 11:59:14,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:59:14,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663930396] [2025-02-05 11:59:14,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663930396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:59:14,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:59:14,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:59:14,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150013997] [2025-02-05 11:59:14,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:59:14,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:59:14,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:59:14,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:59:14,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:59:14,853 INFO L87 Difference]: Start difference. First operand 18099 states and 18439 transitions. Second operand has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:15,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:59:15,520 INFO L93 Difference]: Finished difference Result 38499 states and 39220 transitions. [2025-02-05 11:59:15,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:59:15,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 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 1339 [2025-02-05 11:59:15,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:59:15,540 INFO L225 Difference]: With dead ends: 38499 [2025-02-05 11:59:15,540 INFO L226 Difference]: Without dead ends: 21060 [2025-02-05 11:59:15,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:59:15,552 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 207 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:59:15,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 46 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:59:15,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21060 states. [2025-02-05 11:59:15,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21060 to 19415. [2025-02-05 11:59:15,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19415 states, 19414 states have (on average 1.018234263933244) internal successors, (19768), 19414 states have internal predecessors, (19768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:15,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19415 states to 19415 states and 19768 transitions. [2025-02-05 11:59:15,723 INFO L78 Accepts]: Start accepts. Automaton has 19415 states and 19768 transitions. Word has length 1339 [2025-02-05 11:59:15,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:59:15,723 INFO L471 AbstractCegarLoop]: Abstraction has 19415 states and 19768 transitions. [2025-02-05 11:59:15,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:15,723 INFO L276 IsEmpty]: Start isEmpty. Operand 19415 states and 19768 transitions. [2025-02-05 11:59:15,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1381 [2025-02-05 11:59:15,740 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:59:15,740 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 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] [2025-02-05 11:59:15,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 11:59:15,741 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:59:15,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:59:15,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1640952842, now seen corresponding path program 1 times [2025-02-05 11:59:15,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:59:15,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456970759] [2025-02-05 11:59:15,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:15,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:59:15,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1380 statements into 1 equivalence classes. [2025-02-05 11:59:15,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1380 of 1380 statements. [2025-02-05 11:59:15,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:15,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:17,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4144 backedges. 3187 proven. 132 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2025-02-05 11:59:17,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:59:17,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456970759] [2025-02-05 11:59:17,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456970759] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:59:17,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060374518] [2025-02-05 11:59:17,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:17,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:59:17,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:59:17,293 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:59:17,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 11:59:17,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1380 statements into 1 equivalence classes. [2025-02-05 11:59:17,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1380 of 1380 statements. [2025-02-05 11:59:17,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:17,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:17,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 1630 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:59:17,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:59:17,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4144 backedges. 1205 proven. 0 refuted. 0 times theorem prover too weak. 2939 trivial. 0 not checked. [2025-02-05 11:59:18,000 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:59:18,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060374518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:59:18,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:59:18,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 11:59:18,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447753550] [2025-02-05 11:59:18,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:59:18,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:59:18,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:59:18,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:59:18,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:59:18,001 INFO L87 Difference]: Start difference. First operand 19415 states and 19768 transitions. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:18,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:59:18,550 INFO L93 Difference]: Finished difference Result 38170 states and 38872 transitions. [2025-02-05 11:59:18,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:59:18,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 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 1380 [2025-02-05 11:59:18,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:59:18,567 INFO L225 Difference]: With dead ends: 38170 [2025-02-05 11:59:18,568 INFO L226 Difference]: Without dead ends: 19415 [2025-02-05 11:59:18,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1384 GetRequests, 1380 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:59:18,576 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 117 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:59:18,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 425 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:59:18,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19415 states. [2025-02-05 11:59:18,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19415 to 19415. [2025-02-05 11:59:18,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19415 states, 19414 states have (on average 1.017976717832492) internal successors, (19763), 19414 states have internal predecessors, (19763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:18,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19415 states to 19415 states and 19763 transitions. [2025-02-05 11:59:18,733 INFO L78 Accepts]: Start accepts. Automaton has 19415 states and 19763 transitions. Word has length 1380 [2025-02-05 11:59:18,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:59:18,734 INFO L471 AbstractCegarLoop]: Abstraction has 19415 states and 19763 transitions. [2025-02-05 11:59:18,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:18,734 INFO L276 IsEmpty]: Start isEmpty. Operand 19415 states and 19763 transitions. [2025-02-05 11:59:18,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1634 [2025-02-05 11:59:18,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:59:18,776 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:59:18,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 11:59:18,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:59:18,977 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:59:18,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:59:18,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1032987047, now seen corresponding path program 1 times [2025-02-05 11:59:18,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:59:18,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964127800] [2025-02-05 11:59:18,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:18,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:59:19,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1633 statements into 1 equivalence classes. [2025-02-05 11:59:19,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1633 of 1633 statements. [2025-02-05 11:59:19,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:19,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:20,518 INFO L134 CoverageAnalysis]: Checked inductivity of 5288 backedges. 2067 proven. 1349 refuted. 0 times theorem prover too weak. 1872 trivial. 0 not checked. [2025-02-05 11:59:20,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:59:20,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964127800] [2025-02-05 11:59:20,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964127800] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:59:20,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635772500] [2025-02-05 11:59:20,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:20,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:59:20,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:59:20,522 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:59:20,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 11:59:20,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1633 statements into 1 equivalence classes. [2025-02-05 11:59:20,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1633 of 1633 statements. [2025-02-05 11:59:20,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:20,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:20,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 1899 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:59:20,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:59:21,515 INFO L134 CoverageAnalysis]: Checked inductivity of 5288 backedges. 2865 proven. 0 refuted. 0 times theorem prover too weak. 2423 trivial. 0 not checked. [2025-02-05 11:59:21,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:59:21,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635772500] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:59:21,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:59:21,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 11:59:21,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329475426] [2025-02-05 11:59:21,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:59:21,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:59:21,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:59:21,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:59:21,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:59:21,517 INFO L87 Difference]: Start difference. First operand 19415 states and 19763 transitions. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:22,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:59:22,033 INFO L93 Difference]: Finished difference Result 38170 states and 38862 transitions. [2025-02-05 11:59:22,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:59:22,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1633 [2025-02-05 11:59:22,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:59:22,052 INFO L225 Difference]: With dead ends: 38170 [2025-02-05 11:59:22,052 INFO L226 Difference]: Without dead ends: 19415 [2025-02-05 11:59:22,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1637 GetRequests, 1633 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:59:22,064 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 92 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:59:22,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 377 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:59:22,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19415 states. [2025-02-05 11:59:22,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19415 to 18757. [2025-02-05 11:59:22,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18757 states, 18756 states have (on average 1.0169012582640222) internal successors, (19073), 18756 states have internal predecessors, (19073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:22,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18757 states to 18757 states and 19073 transitions. [2025-02-05 11:59:22,261 INFO L78 Accepts]: Start accepts. Automaton has 18757 states and 19073 transitions. Word has length 1633 [2025-02-05 11:59:22,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:59:22,262 INFO L471 AbstractCegarLoop]: Abstraction has 18757 states and 19073 transitions. [2025-02-05 11:59:22,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:22,262 INFO L276 IsEmpty]: Start isEmpty. Operand 18757 states and 19073 transitions. [2025-02-05 11:59:22,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2022 [2025-02-05 11:59:22,289 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:59:22,290 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:59:22,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 11:59:22,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:59:22,490 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:59:22,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:59:22,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1115138227, now seen corresponding path program 1 times [2025-02-05 11:59:22,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:59:22,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884106121] [2025-02-05 11:59:22,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:22,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:59:22,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2021 statements into 1 equivalence classes. [2025-02-05 11:59:22,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2021 of 2021 statements. [2025-02-05 11:59:22,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:22,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:24,490 INFO L134 CoverageAnalysis]: Checked inductivity of 8247 backedges. 5855 proven. 153 refuted. 0 times theorem prover too weak. 2239 trivial. 0 not checked. [2025-02-05 11:59:24,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:59:24,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884106121] [2025-02-05 11:59:24,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884106121] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:59:24,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250598351] [2025-02-05 11:59:24,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:24,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:59:24,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:59:24,493 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:59:24,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 11:59:24,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2021 statements into 1 equivalence classes. [2025-02-05 11:59:24,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2021 of 2021 statements. [2025-02-05 11:59:24,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:24,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:24,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 2331 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:59:24,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:59:25,023 INFO L134 CoverageAnalysis]: Checked inductivity of 8247 backedges. 4850 proven. 0 refuted. 0 times theorem prover too weak. 3397 trivial. 0 not checked. [2025-02-05 11:59:25,023 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:59:25,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250598351] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:59:25,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:59:25,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 11:59:25,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056782035] [2025-02-05 11:59:25,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:59:25,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:59:25,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:59:25,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:59:25,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:59:25,026 INFO L87 Difference]: Start difference. First operand 18757 states and 19073 transitions. Second operand has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:25,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:59:25,663 INFO L93 Difference]: Finished difference Result 39159 states and 39823 transitions. [2025-02-05 11:59:25,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:59:25,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 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 2021 [2025-02-05 11:59:25,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:59:25,683 INFO L225 Difference]: With dead ends: 39159 [2025-02-05 11:59:25,683 INFO L226 Difference]: Without dead ends: 21062 [2025-02-05 11:59:25,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2026 GetRequests, 2021 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:59:25,696 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 223 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:59:25,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 427 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:59:25,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21062 states. [2025-02-05 11:59:25,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21062 to 19744. [2025-02-05 11:59:25,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19744 states, 19743 states have (on average 1.0164108798055007) internal successors, (20067), 19743 states have internal predecessors, (20067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:25,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19744 states to 19744 states and 20067 transitions. [2025-02-05 11:59:25,860 INFO L78 Accepts]: Start accepts. Automaton has 19744 states and 20067 transitions. Word has length 2021 [2025-02-05 11:59:25,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:59:25,860 INFO L471 AbstractCegarLoop]: Abstraction has 19744 states and 20067 transitions. [2025-02-05 11:59:25,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:25,860 INFO L276 IsEmpty]: Start isEmpty. Operand 19744 states and 20067 transitions. [2025-02-05 11:59:25,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2053 [2025-02-05 11:59:25,884 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:59:25,885 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:59:25,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 11:59:26,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:59:26,086 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:59:26,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:59:26,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1435775873, now seen corresponding path program 1 times [2025-02-05 11:59:26,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:59:26,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080528181] [2025-02-05 11:59:26,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:26,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:59:26,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2052 statements into 1 equivalence classes. [2025-02-05 11:59:26,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2052 of 2052 statements. [2025-02-05 11:59:26,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:26,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:28,169 INFO L134 CoverageAnalysis]: Checked inductivity of 8669 backedges. 6448 proven. 91 refuted. 0 times theorem prover too weak. 2130 trivial. 0 not checked. [2025-02-05 11:59:28,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:59:28,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080528181] [2025-02-05 11:59:28,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080528181] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:59:28,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273491771] [2025-02-05 11:59:28,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:28,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:59:28,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:59:28,171 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:59:28,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 11:59:28,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2052 statements into 1 equivalence classes. [2025-02-05 11:59:28,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2052 of 2052 statements. [2025-02-05 11:59:28,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:28,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:28,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 2365 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 11:59:28,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:59:31,507 INFO L134 CoverageAnalysis]: Checked inductivity of 8669 backedges. 6613 proven. 157 refuted. 0 times theorem prover too weak. 1899 trivial. 0 not checked. [2025-02-05 11:59:31,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:59:33,778 INFO L134 CoverageAnalysis]: Checked inductivity of 8669 backedges. 6349 proven. 421 refuted. 0 times theorem prover too weak. 1899 trivial. 0 not checked. [2025-02-05 11:59:33,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273491771] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:59:33,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:59:33,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2025-02-05 11:59:33,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732279372] [2025-02-05 11:59:33,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:59:33,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 11:59:33,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:59:33,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 11:59:33,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-05 11:59:33,783 INFO L87 Difference]: Start difference. First operand 19744 states and 20067 transitions. Second operand has 12 states, 12 states have (on average 149.33333333333334) internal successors, (1792), 12 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:36,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:59:36,430 INFO L93 Difference]: Finished difference Result 39159 states and 39804 transitions. [2025-02-05 11:59:36,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 11:59:36,430 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 149.33333333333334) internal successors, (1792), 12 states have internal predecessors, (1792), 0 states have call successors, (0), 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 2052 [2025-02-05 11:59:36,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:59:36,444 INFO L225 Difference]: With dead ends: 39159 [2025-02-05 11:59:36,444 INFO L226 Difference]: Without dead ends: 20075 [2025-02-05 11:59:36,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4114 GetRequests, 4101 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-02-05 11:59:36,456 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 1527 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 7402 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 7441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 7402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:59:36,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1527 Valid, 449 Invalid, 7441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 7402 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:59:36,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20075 states. [2025-02-05 11:59:36,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20075 to 20073. [2025-02-05 11:59:36,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20073 states, 20072 states have (on average 1.0158429653248306) internal successors, (20390), 20072 states have internal predecessors, (20390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:36,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20073 states to 20073 states and 20390 transitions. [2025-02-05 11:59:36,584 INFO L78 Accepts]: Start accepts. Automaton has 20073 states and 20390 transitions. Word has length 2052 [2025-02-05 11:59:36,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:59:36,585 INFO L471 AbstractCegarLoop]: Abstraction has 20073 states and 20390 transitions. [2025-02-05 11:59:36,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 149.33333333333334) internal successors, (1792), 12 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:36,585 INFO L276 IsEmpty]: Start isEmpty. Operand 20073 states and 20390 transitions. [2025-02-05 11:59:36,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2253 [2025-02-05 11:59:36,611 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:59:36,611 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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] [2025-02-05 11:59:36,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 11:59:36,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-05 11:59:36,812 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:59:36,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:59:36,813 INFO L85 PathProgramCache]: Analyzing trace with hash 870024361, now seen corresponding path program 1 times [2025-02-05 11:59:36,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:59:36,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515750885] [2025-02-05 11:59:36,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:36,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:59:36,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2252 statements into 1 equivalence classes. [2025-02-05 11:59:36,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2252 of 2252 statements. [2025-02-05 11:59:36,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:36,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:39,099 INFO L134 CoverageAnalysis]: Checked inductivity of 9993 backedges. 7100 proven. 153 refuted. 0 times theorem prover too weak. 2740 trivial. 0 not checked. [2025-02-05 11:59:39,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:59:39,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515750885] [2025-02-05 11:59:39,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515750885] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:59:39,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056016570] [2025-02-05 11:59:39,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:39,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:59:39,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:59:39,101 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:59:39,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 11:59:39,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2252 statements into 1 equivalence classes. [2025-02-05 11:59:39,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2252 of 2252 statements. [2025-02-05 11:59:39,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:39,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:39,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 2565 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:59:39,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:59:39,775 INFO L134 CoverageAnalysis]: Checked inductivity of 9993 backedges. 3398 proven. 0 refuted. 0 times theorem prover too weak. 6595 trivial. 0 not checked. [2025-02-05 11:59:39,775 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:59:39,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056016570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:59:39,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:59:39,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 11:59:39,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276816758] [2025-02-05 11:59:39,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:59:39,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:59:39,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:59:39,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:59:39,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:59:39,777 INFO L87 Difference]: Start difference. First operand 20073 states and 20390 transitions. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:40,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:59:40,413 INFO L93 Difference]: Finished difference Result 42118 states and 42791 transitions. [2025-02-05 11:59:40,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:59:40,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 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 2252 [2025-02-05 11:59:40,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:59:40,432 INFO L225 Difference]: With dead ends: 42118 [2025-02-05 11:59:40,432 INFO L226 Difference]: Without dead ends: 22705 [2025-02-05 11:59:40,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2257 GetRequests, 2252 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:59:40,442 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 182 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:59:40,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 46 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:59:40,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22705 states. [2025-02-05 11:59:40,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22705 to 20073. [2025-02-05 11:59:40,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20073 states, 20072 states have (on average 1.0155938620964529) internal successors, (20385), 20072 states have internal predecessors, (20385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:40,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20073 states to 20073 states and 20385 transitions. [2025-02-05 11:59:40,586 INFO L78 Accepts]: Start accepts. Automaton has 20073 states and 20385 transitions. Word has length 2252 [2025-02-05 11:59:40,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:59:40,587 INFO L471 AbstractCegarLoop]: Abstraction has 20073 states and 20385 transitions. [2025-02-05 11:59:40,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:40,587 INFO L276 IsEmpty]: Start isEmpty. Operand 20073 states and 20385 transitions. [2025-02-05 11:59:40,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2319 [2025-02-05 11:59:40,614 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:59:40,615 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:59:40,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 11:59:40,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:59:40,815 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:59:40,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:59:40,816 INFO L85 PathProgramCache]: Analyzing trace with hash 447445294, now seen corresponding path program 1 times [2025-02-05 11:59:40,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:59:40,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683195427] [2025-02-05 11:59:40,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:40,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:59:40,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2318 statements into 1 equivalence classes. [2025-02-05 11:59:40,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2318 of 2318 statements. [2025-02-05 11:59:40,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:40,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:43,373 INFO L134 CoverageAnalysis]: Checked inductivity of 10390 backedges. 7378 proven. 153 refuted. 0 times theorem prover too weak. 2859 trivial. 0 not checked. [2025-02-05 11:59:43,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:59:43,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683195427] [2025-02-05 11:59:43,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683195427] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:59:43,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880565552] [2025-02-05 11:59:43,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:43,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:59:43,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:59:43,375 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:59:43,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 11:59:43,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2318 statements into 1 equivalence classes. [2025-02-05 11:59:43,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2318 of 2318 statements. [2025-02-05 11:59:43,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:43,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:43,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 2631 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 11:59:43,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:59:48,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10390 backedges. 6870 proven. 67 refuted. 0 times theorem prover too weak. 3453 trivial. 0 not checked. [2025-02-05 11:59:48,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:59:50,540 INFO L134 CoverageAnalysis]: Checked inductivity of 10390 backedges. 5816 proven. 0 refuted. 0 times theorem prover too weak. 4574 trivial. 0 not checked. [2025-02-05 11:59:50,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880565552] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 11:59:50,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 11:59:50,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 4] total 9 [2025-02-05 11:59:50,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585814273] [2025-02-05 11:59:50,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:59:50,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:59:50,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:59:50,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:59:50,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:59:50,542 INFO L87 Difference]: Start difference. First operand 20073 states and 20385 transitions. Second operand has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:51,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:59:51,234 INFO L93 Difference]: Finished difference Result 41131 states and 41777 transitions. [2025-02-05 11:59:51,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:59:51,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 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 2318 [2025-02-05 11:59:51,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:59:51,250 INFO L225 Difference]: With dead ends: 41131 [2025-02-05 11:59:51,250 INFO L226 Difference]: Without dead ends: 21718 [2025-02-05 11:59:51,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4640 GetRequests, 4633 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:59:51,257 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 269 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:59:51,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 29 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:59:51,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21718 states. [2025-02-05 11:59:51,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21718 to 20073. [2025-02-05 11:59:51,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20073 states, 20072 states have (on average 1.0148963730569949) internal successors, (20371), 20072 states have internal predecessors, (20371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:51,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20073 states to 20073 states and 20371 transitions. [2025-02-05 11:59:51,396 INFO L78 Accepts]: Start accepts. Automaton has 20073 states and 20371 transitions. Word has length 2318 [2025-02-05 11:59:51,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:59:51,397 INFO L471 AbstractCegarLoop]: Abstraction has 20073 states and 20371 transitions. [2025-02-05 11:59:51,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 20073 states and 20371 transitions. [2025-02-05 11:59:51,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2323 [2025-02-05 11:59:51,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:59:51,426 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:59:51,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 11:59:51,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:59:51,627 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:59:51,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:59:51,628 INFO L85 PathProgramCache]: Analyzing trace with hash -938778592, now seen corresponding path program 1 times [2025-02-05 11:59:51,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:59:51,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355075242] [2025-02-05 11:59:51,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:51,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:59:51,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2322 statements into 1 equivalence classes. [2025-02-05 11:59:51,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2322 of 2322 statements. [2025-02-05 11:59:51,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:51,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 11015 backedges. 6664 proven. 79 refuted. 0 times theorem prover too weak. 4272 trivial. 0 not checked. [2025-02-05 11:59:54,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:59:54,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355075242] [2025-02-05 11:59:54,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355075242] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:59:54,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110623021] [2025-02-05 11:59:54,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:59:54,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:59:54,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:59:54,627 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:59:54,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 11:59:54,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2322 statements into 1 equivalence classes. [2025-02-05 11:59:55,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2322 of 2322 statements. [2025-02-05 11:59:55,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:59:55,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:59:55,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 2659 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 11:59:55,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:59:55,598 INFO L134 CoverageAnalysis]: Checked inductivity of 11015 backedges. 7019 proven. 250 refuted. 0 times theorem prover too weak. 3746 trivial. 0 not checked. [2025-02-05 11:59:55,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:59:56,677 INFO L134 CoverageAnalysis]: Checked inductivity of 11015 backedges. 6088 proven. 0 refuted. 0 times theorem prover too weak. 4927 trivial. 0 not checked. [2025-02-05 11:59:56,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110623021] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 11:59:56,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 11:59:56,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 7 [2025-02-05 11:59:56,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768345598] [2025-02-05 11:59:56,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:59:56,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:59:56,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:59:56,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:59:56,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:59:56,680 INFO L87 Difference]: Start difference. First operand 20073 states and 20371 transitions. Second operand has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:57,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:59:57,335 INFO L93 Difference]: Finished difference Result 39815 states and 40409 transitions. [2025-02-05 11:59:57,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:59:57,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 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 2322 [2025-02-05 11:59:57,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:59:57,405 INFO L225 Difference]: With dead ends: 39815 [2025-02-05 11:59:57,405 INFO L226 Difference]: Without dead ends: 20073 [2025-02-05 11:59:57,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4646 GetRequests, 4641 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:59:57,410 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 84 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:59:57,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 18 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:59:57,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20073 states. [2025-02-05 11:59:57,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20073 to 20073. [2025-02-05 11:59:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20073 states, 20072 states have (on average 1.014647269828617) internal successors, (20366), 20072 states have internal predecessors, (20366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:57,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20073 states to 20073 states and 20366 transitions. [2025-02-05 11:59:57,547 INFO L78 Accepts]: Start accepts. Automaton has 20073 states and 20366 transitions. Word has length 2322 [2025-02-05 11:59:57,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:59:57,548 INFO L471 AbstractCegarLoop]: Abstraction has 20073 states and 20366 transitions. [2025-02-05 11:59:57,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:59:57,548 INFO L276 IsEmpty]: Start isEmpty. Operand 20073 states and 20366 transitions. [2025-02-05 11:59:57,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2390 [2025-02-05 11:59:57,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:59:57,579 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:59:57,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0