./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label01.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/Problem12_label01.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 65de5b720550425739629c673edc29b7a854e52f56e69a2e107d2cca3ffb2713 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:34:39,288 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:34:39,326 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:34:39,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:34:39,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:34:39,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:34:39,345 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:34:39,345 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:34:39,345 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:34:39,345 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:34:39,345 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:34:39,345 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:34:39,346 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:34:39,346 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:34:39,346 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:34:39,346 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:34:39,346 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:34:39,346 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:34:39,346 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:34:39,346 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:34:39,346 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:34:39,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:34:39,347 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:34:39,347 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:34:39,347 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:34:39,347 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:34:39,347 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:34:39,347 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:34:39,347 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:34:39,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:34:39,347 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:34:39,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:34:39,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:34:39,348 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:34:39,348 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:34:39,348 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:34:39,348 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:34:39,348 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:34:39,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:34:39,348 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:34:39,348 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:34:39,348 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:34:39,348 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:34:39,348 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 -> 65de5b720550425739629c673edc29b7a854e52f56e69a2e107d2cca3ffb2713 [2025-02-05 11:34:39,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:34:39,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:34:39,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:34:39,600 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:34:39,601 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:34:39,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label01.c [2025-02-05 11:34:40,807 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e49011df/cee1a28dbb494c8787170d456a457504/FLAG9b25738a5 [2025-02-05 11:34:41,471 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:34:41,472 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label01.c [2025-02-05 11:34:41,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e49011df/cee1a28dbb494c8787170d456a457504/FLAG9b25738a5 [2025-02-05 11:34:41,525 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7e49011df/cee1a28dbb494c8787170d456a457504 [2025-02-05 11:34:41,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:34:41,534 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:34:41,535 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:34:41,535 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:34:41,543 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:34:41,544 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:34:41" (1/1) ... [2025-02-05 11:34:41,545 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a9577a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:41, skipping insertion in model container [2025-02-05 11:34:41,547 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:34:41" (1/1) ... [2025-02-05 11:34:41,648 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:34:41,838 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/Problem12_label01.c[5916,5929] [2025-02-05 11:34:42,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:34:42,335 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:34:42,357 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/Problem12_label01.c[5916,5929] [2025-02-05 11:34:42,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:34:42,705 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:34:42,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:42 WrapperNode [2025-02-05 11:34:42,706 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:34:42,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:34:42,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:34:42,707 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:34:42,713 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:34:42" (1/1) ... [2025-02-05 11:34:42,767 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:34:42" (1/1) ... [2025-02-05 11:34:43,048 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-02-05 11:34:43,049 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:34:43,049 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:34:43,049 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:34:43,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:34:43,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:42" (1/1) ... [2025-02-05 11:34:43,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:42" (1/1) ... [2025-02-05 11:34:43,113 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:42" (1/1) ... [2025-02-05 11:34:43,312 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:34:43,313 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:42" (1/1) ... [2025-02-05 11:34:43,313 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:42" (1/1) ... [2025-02-05 11:34:43,472 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:42" (1/1) ... [2025-02-05 11:34:43,491 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:42" (1/1) ... [2025-02-05 11:34:43,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:42" (1/1) ... [2025-02-05 11:34:43,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:42" (1/1) ... [2025-02-05 11:34:43,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:34:43,565 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:34:43,566 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:34:43,566 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:34:43,567 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:42" (1/1) ... [2025-02-05 11:34:43,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:34:43,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:34:43,592 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:34:43,608 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:34:43,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:34:43,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:34:43,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:34:43,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:34:43,689 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:34:43,695 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:34:47,751 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-02-05 11:34:47,756 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-02-05 11:34:47,756 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-02-05 11:34:48,057 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-02-05 11:34:48,057 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:34:48,091 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:34:48,095 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:34:48,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:34:48 BoogieIcfgContainer [2025-02-05 11:34:48,095 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:34:48,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:34:48,100 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:34:48,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:34:48,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:34:41" (1/3) ... [2025-02-05 11:34:48,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee13c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:34:48, skipping insertion in model container [2025-02-05 11:34:48,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:34:42" (2/3) ... [2025-02-05 11:34:48,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee13c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:34:48, skipping insertion in model container [2025-02-05 11:34:48,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:34:48" (3/3) ... [2025-02-05 11:34:48,110 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label01.c [2025-02-05 11:34:48,128 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:34:48,134 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label01.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:34:48,233 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:34:48,248 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;@38950182, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:34:48,251 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:34:48,261 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have 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:34:48,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 11:34:48,270 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:48,270 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:34:48,274 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:48,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:48,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1699546739, now seen corresponding path program 1 times [2025-02-05 11:34:48,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:48,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586334524] [2025-02-05 11:34:48,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:48,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:48,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 11:34:48,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 11:34:48,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:48,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:48,757 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:34:48,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:48,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586334524] [2025-02-05 11:34:48,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586334524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:48,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:48,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:48,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237962399] [2025-02-05 11:34:48,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:48,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:34:48,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:48,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:34:48,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:48,805 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have 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:34:54,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:54,795 INFO L93 Difference]: Finished difference Result 3142 states and 6126 transitions. [2025-02-05 11:34:54,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:34:54,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-02-05 11:34:54,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:54,824 INFO L225 Difference]: With dead ends: 3142 [2025-02-05 11:34:54,825 INFO L226 Difference]: Without dead ends: 2257 [2025-02-05 11:34:54,832 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:34:54,835 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 2227 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5499 mSolverCounterSat, 1273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2227 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 6772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1273 IncrementalHoareTripleChecker+Valid, 5499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:54,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2227 Valid, 765 Invalid, 6772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1273 Valid, 5499 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2025-02-05 11:34:54,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2025-02-05 11:34:54,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2257. [2025-02-05 11:34:54,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 2256 states have (on average 1.5749113475177305) internal successors, (3553), 2256 states have internal predecessors, (3553), 0 states have call successors, (0), 0 states have 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:34:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3553 transitions. [2025-02-05 11:34:54,967 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3553 transitions. Word has length 47 [2025-02-05 11:34:54,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:54,968 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 3553 transitions. [2025-02-05 11:34:54,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have 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:34:54,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3553 transitions. [2025-02-05 11:34:54,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 11:34:54,972 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:54,973 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:34:54,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:34:54,974 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:54,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:54,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1655907472, now seen corresponding path program 1 times [2025-02-05 11:34:54,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:54,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724102207] [2025-02-05 11:34:54,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:54,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:54,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 11:34:55,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 11:34:55,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:55,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:34:55,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:55,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724102207] [2025-02-05 11:34:55,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724102207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:55,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:34:55,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:34:55,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2501167] [2025-02-05 11:34:55,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:55,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:34:55,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:55,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:34:55,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:34:55,283 INFO L87 Difference]: Start difference. First operand 2257 states and 3553 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have 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:34:58,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:34:58,529 INFO L93 Difference]: Finished difference Result 6053 states and 9917 transitions. [2025-02-05 11:34:58,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:34:58,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2025-02-05 11:34:58,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:34:58,541 INFO L225 Difference]: With dead ends: 6053 [2025-02-05 11:34:58,542 INFO L226 Difference]: Without dead ends: 3761 [2025-02-05 11:34:58,545 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:34:58,546 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 690 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 3781 mSolverCounterSat, 663 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 4444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 663 IncrementalHoareTripleChecker+Valid, 3781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:34:58,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 694 Invalid, 4444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [663 Valid, 3781 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-05 11:34:58,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3761 states. [2025-02-05 11:34:58,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3761 to 3759. [2025-02-05 11:34:58,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 3758 states have (on average 1.3680149015433742) internal successors, (5141), 3758 states have internal predecessors, (5141), 0 states have call successors, (0), 0 states have 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:34:58,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 5141 transitions. [2025-02-05 11:34:58,631 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 5141 transitions. Word has length 118 [2025-02-05 11:34:58,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:34:58,635 INFO L471 AbstractCegarLoop]: Abstraction has 3759 states and 5141 transitions. [2025-02-05 11:34:58,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have 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:34:58,635 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 5141 transitions. [2025-02-05 11:34:58,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-02-05 11:34:58,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:34:58,643 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:58,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:34:58,643 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:34:58,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:34:58,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1454182079, now seen corresponding path program 1 times [2025-02-05 11:34:58,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:34:58,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652304030] [2025-02-05 11:34:58,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:58,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:34:58,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-02-05 11:34:58,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-02-05 11:34:58,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:58,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:59,158 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 89 proven. 54 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 11:34:59,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:34:59,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652304030] [2025-02-05 11:34:59,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652304030] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:34:59,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193707171] [2025-02-05 11:34:59,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:34:59,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:34:59,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:34:59,169 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:34:59,171 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:34:59,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-02-05 11:34:59,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-02-05 11:34:59,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:34:59,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:34:59,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:34:59,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:34:59,583 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-02-05 11:34:59,583 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:34:59,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193707171] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:34:59,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:34:59,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-02-05 11:34:59,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066855584] [2025-02-05 11:34:59,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:34:59,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:34:59,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:34:59,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:34:59,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:34:59,585 INFO L87 Difference]: Start difference. First operand 3759 states and 5141 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 2 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have 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:35:02,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:02,022 INFO L93 Difference]: Finished difference Result 9769 states and 13189 transitions. [2025-02-05 11:35:02,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:35:02,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 2 states have internal predecessors, (190), 0 states have call successors, (0), 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 257 [2025-02-05 11:35:02,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:02,045 INFO L225 Difference]: With dead ends: 9769 [2025-02-05 11:35:02,045 INFO L226 Difference]: Without dead ends: 6012 [2025-02-05 11:35:02,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 256 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:35:02,051 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 697 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 798 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 2771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 798 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:02,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 427 Invalid, 2771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [798 Valid, 1973 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 11:35:02,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2025-02-05 11:35:02,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 6012. [2025-02-05 11:35:02,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6012 states, 6011 states have (on average 1.1750124771252703) internal successors, (7063), 6011 states have internal predecessors, (7063), 0 states have call successors, (0), 0 states have 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:35:02,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 7063 transitions. [2025-02-05 11:35:02,141 INFO L78 Accepts]: Start accepts. Automaton has 6012 states and 7063 transitions. Word has length 257 [2025-02-05 11:35:02,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:02,142 INFO L471 AbstractCegarLoop]: Abstraction has 6012 states and 7063 transitions. [2025-02-05 11:35:02,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 2 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have 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:35:02,142 INFO L276 IsEmpty]: Start isEmpty. Operand 6012 states and 7063 transitions. [2025-02-05 11:35:02,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-02-05 11:35:02,144 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:02,144 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:02,182 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:35:02,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:35:02,375 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:02,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:02,376 INFO L85 PathProgramCache]: Analyzing trace with hash -2053445788, now seen corresponding path program 1 times [2025-02-05 11:35:02,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:02,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488225716] [2025-02-05 11:35:02,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:02,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:02,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-02-05 11:35:02,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-02-05 11:35:02,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:02,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:02,712 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-05 11:35:02,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:02,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488225716] [2025-02-05 11:35:02,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488225716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:02,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:35:02,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:35:02,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378896874] [2025-02-05 11:35:02,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:02,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:35:02,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:02,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:35:02,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:35:02,713 INFO L87 Difference]: Start difference. First operand 6012 states and 7063 transitions. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have 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:35:05,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:05,998 INFO L93 Difference]: Finished difference Result 13563 states and 16588 transitions. [2025-02-05 11:35:05,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:35:05,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 259 [2025-02-05 11:35:05,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:06,018 INFO L225 Difference]: With dead ends: 13563 [2025-02-05 11:35:06,018 INFO L226 Difference]: Without dead ends: 8267 [2025-02-05 11:35:06,028 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:35:06,029 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 775 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 3718 mSolverCounterSat, 542 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 4260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 542 IncrementalHoareTripleChecker+Valid, 3718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:06,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 327 Invalid, 4260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [542 Valid, 3718 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-05 11:35:06,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8267 states. [2025-02-05 11:35:06,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8267 to 8265. [2025-02-05 11:35:06,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8265 states, 8264 states have (on average 1.1659002904162634) internal successors, (9635), 8264 states have internal predecessors, (9635), 0 states have call successors, (0), 0 states have 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:35:06,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8265 states to 8265 states and 9635 transitions. [2025-02-05 11:35:06,160 INFO L78 Accepts]: Start accepts. Automaton has 8265 states and 9635 transitions. Word has length 259 [2025-02-05 11:35:06,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:06,160 INFO L471 AbstractCegarLoop]: Abstraction has 8265 states and 9635 transitions. [2025-02-05 11:35:06,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have 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:35:06,161 INFO L276 IsEmpty]: Start isEmpty. Operand 8265 states and 9635 transitions. [2025-02-05 11:35:06,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-02-05 11:35:06,164 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:06,165 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-02-05 11:35:06,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:35:06,165 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:06,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:06,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1327435398, now seen corresponding path program 1 times [2025-02-05 11:35:06,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:06,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443406617] [2025-02-05 11:35:06,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:06,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:06,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-02-05 11:35:06,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-02-05 11:35:06,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:06,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:06,548 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 134 proven. 108 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-02-05 11:35:06,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:06,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443406617] [2025-02-05 11:35:06,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443406617] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:35:06,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134356240] [2025-02-05 11:35:06,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:06,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:35:06,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:35:06,556 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:35:06,557 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:35:06,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-02-05 11:35:06,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-02-05 11:35:06,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:06,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:06,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:35:06,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:35:06,828 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-02-05 11:35:06,830 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:35:06,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134356240] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:06,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:35:06,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-02-05 11:35:06,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354663315] [2025-02-05 11:35:06,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:06,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:35:06,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:06,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:35:06,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:35:06,832 INFO L87 Difference]: Start difference. First operand 8265 states and 9635 transitions. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:35:09,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:09,440 INFO L93 Difference]: Finished difference Result 18030 states and 21666 transitions. [2025-02-05 11:35:09,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:35:09,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 336 [2025-02-05 11:35:09,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:09,508 INFO L225 Difference]: With dead ends: 18030 [2025-02-05 11:35:09,508 INFO L226 Difference]: Without dead ends: 10518 [2025-02-05 11:35:09,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 335 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:35:09,518 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 789 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2067 mSolverCounterSat, 818 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 2885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 818 IncrementalHoareTripleChecker+Valid, 2067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:09,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 235 Invalid, 2885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [818 Valid, 2067 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:35:09,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10518 states. [2025-02-05 11:35:09,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10518 to 10518. [2025-02-05 11:35:09,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10518 states, 10517 states have (on average 1.1735285727869165) internal successors, (12342), 10517 states have internal predecessors, (12342), 0 states have call successors, (0), 0 states have 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:35:09,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10518 states to 10518 states and 12342 transitions. [2025-02-05 11:35:09,726 INFO L78 Accepts]: Start accepts. Automaton has 10518 states and 12342 transitions. Word has length 336 [2025-02-05 11:35:09,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:09,727 INFO L471 AbstractCegarLoop]: Abstraction has 10518 states and 12342 transitions. [2025-02-05 11:35:09,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:35:09,727 INFO L276 IsEmpty]: Start isEmpty. Operand 10518 states and 12342 transitions. [2025-02-05 11:35:09,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-02-05 11:35:09,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:09,731 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:35:09,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 11:35:09,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:35:09,939 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:09,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:09,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1594481063, now seen corresponding path program 1 times [2025-02-05 11:35:09,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:09,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871301169] [2025-02-05 11:35:09,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:09,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:09,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-02-05 11:35:10,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-02-05 11:35:10,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:10,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:10,169 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 342 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-05 11:35:10,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:10,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871301169] [2025-02-05 11:35:10,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871301169] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:10,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:35:10,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:35:10,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966868456] [2025-02-05 11:35:10,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:10,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:35:10,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:10,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:35:10,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:35:10,171 INFO L87 Difference]: Start difference. First operand 10518 states and 12342 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have 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:35:12,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:12,842 INFO L93 Difference]: Finished difference Result 28544 states and 33989 transitions. [2025-02-05 11:35:12,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:35:12,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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 374 [2025-02-05 11:35:12,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:12,912 INFO L225 Difference]: With dead ends: 28544 [2025-02-05 11:35:12,916 INFO L226 Difference]: Without dead ends: 18779 [2025-02-05 11:35:12,929 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:35:12,933 INFO L435 NwaCegarLoop]: 1258 mSDtfsCounter, 636 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 3021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 2630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:12,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 1265 Invalid, 3021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 2630 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:35:12,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18779 states. [2025-02-05 11:35:13,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18779 to 18028. [2025-02-05 11:35:13,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18028 states, 18027 states have (on average 1.1682476285571644) internal successors, (21060), 18027 states have internal predecessors, (21060), 0 states have call successors, (0), 0 states have 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:35:13,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18028 states to 18028 states and 21060 transitions. [2025-02-05 11:35:13,449 INFO L78 Accepts]: Start accepts. Automaton has 18028 states and 21060 transitions. Word has length 374 [2025-02-05 11:35:13,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:13,453 INFO L471 AbstractCegarLoop]: Abstraction has 18028 states and 21060 transitions. [2025-02-05 11:35:13,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have 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:35:13,454 INFO L276 IsEmpty]: Start isEmpty. Operand 18028 states and 21060 transitions. [2025-02-05 11:35:13,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-02-05 11:35:13,467 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:13,468 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:35:13,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:35:13,468 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:13,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:13,469 INFO L85 PathProgramCache]: Analyzing trace with hash -89758139, now seen corresponding path program 1 times [2025-02-05 11:35:13,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:13,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100502605] [2025-02-05 11:35:13,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:13,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:13,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-02-05 11:35:13,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-02-05 11:35:13,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:13,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:13,897 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-05 11:35:13,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:13,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100502605] [2025-02-05 11:35:13,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100502605] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:13,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:35:13,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:35:13,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213217635] [2025-02-05 11:35:13,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:13,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:35:13,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:13,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:35:13,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:35:13,904 INFO L87 Difference]: Start difference. First operand 18028 states and 21060 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:35:16,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:16,587 INFO L93 Difference]: Finished difference Result 42062 states and 49890 transitions. [2025-02-05 11:35:16,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:35:16,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 375 [2025-02-05 11:35:16,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:16,624 INFO L225 Difference]: With dead ends: 42062 [2025-02-05 11:35:16,624 INFO L226 Difference]: Without dead ends: 24787 [2025-02-05 11:35:16,641 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:35:16,642 INFO L435 NwaCegarLoop]: 1377 mSDtfsCounter, 710 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2506 mSolverCounterSat, 474 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1385 SdHoareTripleChecker+Invalid, 2980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 474 IncrementalHoareTripleChecker+Valid, 2506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:16,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 1385 Invalid, 2980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [474 Valid, 2506 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:35:16,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24787 states. [2025-02-05 11:35:16,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24787 to 24036. [2025-02-05 11:35:16,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24036 states, 24035 states have (on average 1.173871437486998) internal successors, (28214), 24035 states have internal predecessors, (28214), 0 states have call successors, (0), 0 states have 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:35:16,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24036 states to 24036 states and 28214 transitions. [2025-02-05 11:35:16,915 INFO L78 Accepts]: Start accepts. Automaton has 24036 states and 28214 transitions. Word has length 375 [2025-02-05 11:35:16,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:16,915 INFO L471 AbstractCegarLoop]: Abstraction has 24036 states and 28214 transitions. [2025-02-05 11:35:16,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:35:16,915 INFO L276 IsEmpty]: Start isEmpty. Operand 24036 states and 28214 transitions. [2025-02-05 11:35:16,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-02-05 11:35:16,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:16,920 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:35:16,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:35:16,921 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:16,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:16,921 INFO L85 PathProgramCache]: Analyzing trace with hash -2088392591, now seen corresponding path program 1 times [2025-02-05 11:35:16,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:16,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964248696] [2025-02-05 11:35:16,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:16,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:16,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-02-05 11:35:16,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-02-05 11:35:16,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:16,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:17,090 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-02-05 11:35:17,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:17,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964248696] [2025-02-05 11:35:17,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964248696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:17,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:35:17,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:35:17,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114395757] [2025-02-05 11:35:17,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:17,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:35:17,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:17,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:35:17,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:35:17,093 INFO L87 Difference]: Start difference. First operand 24036 states and 28214 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have 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:35:20,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:20,064 INFO L93 Difference]: Finished difference Result 48070 states and 56429 transitions. [2025-02-05 11:35:20,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:35:20,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 378 [2025-02-05 11:35:20,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:20,126 INFO L225 Difference]: With dead ends: 48070 [2025-02-05 11:35:20,126 INFO L226 Difference]: Without dead ends: 24787 [2025-02-05 11:35:20,146 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:35:20,147 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 732 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2485 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 2907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 2485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:20,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 356 Invalid, 2907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 2485 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 11:35:20,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24787 states. [2025-02-05 11:35:20,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24787 to 23285. [2025-02-05 11:35:20,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23285 states, 23284 states have (on average 1.1550850369352346) internal successors, (26895), 23284 states have internal predecessors, (26895), 0 states have call successors, (0), 0 states have 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:35:20,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23285 states to 23285 states and 26895 transitions. [2025-02-05 11:35:20,408 INFO L78 Accepts]: Start accepts. Automaton has 23285 states and 26895 transitions. Word has length 378 [2025-02-05 11:35:20,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:20,409 INFO L471 AbstractCegarLoop]: Abstraction has 23285 states and 26895 transitions. [2025-02-05 11:35:20,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have 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:35:20,409 INFO L276 IsEmpty]: Start isEmpty. Operand 23285 states and 26895 transitions. [2025-02-05 11:35:20,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-02-05 11:35:20,414 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:20,415 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:35:20,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:35:20,416 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:20,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:20,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1611507653, now seen corresponding path program 1 times [2025-02-05 11:35:20,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:20,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767484312] [2025-02-05 11:35:20,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:20,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:20,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-02-05 11:35:20,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-02-05 11:35:20,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:20,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:20,756 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 516 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-02-05 11:35:20,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:20,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767484312] [2025-02-05 11:35:20,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767484312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:20,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:35:20,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:35:20,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482654229] [2025-02-05 11:35:20,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:20,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:35:20,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:20,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:35:20,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:35:20,759 INFO L87 Difference]: Start difference. First operand 23285 states and 26895 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have 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:35:23,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:23,561 INFO L93 Difference]: Finished difference Result 63841 states and 74478 transitions. [2025-02-05 11:35:23,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:35:23,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 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 433 [2025-02-05 11:35:23,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:23,604 INFO L225 Difference]: With dead ends: 63841 [2025-02-05 11:35:23,604 INFO L226 Difference]: Without dead ends: 41309 [2025-02-05 11:35:23,613 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:35:23,617 INFO L435 NwaCegarLoop]: 1263 mSDtfsCounter, 735 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2136 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 2824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 2136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:23,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 1270 Invalid, 2824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 2136 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:35:23,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41309 states. [2025-02-05 11:35:23,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41309 to 39807. [2025-02-05 11:35:23,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39807 states, 39806 states have (on average 1.1209867859116716) internal successors, (44622), 39806 states have internal predecessors, (44622), 0 states have call successors, (0), 0 states have 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:35:23,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39807 states to 39807 states and 44622 transitions. [2025-02-05 11:35:23,982 INFO L78 Accepts]: Start accepts. Automaton has 39807 states and 44622 transitions. Word has length 433 [2025-02-05 11:35:23,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:23,983 INFO L471 AbstractCegarLoop]: Abstraction has 39807 states and 44622 transitions. [2025-02-05 11:35:23,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have 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:35:23,984 INFO L276 IsEmpty]: Start isEmpty. Operand 39807 states and 44622 transitions. [2025-02-05 11:35:23,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-02-05 11:35:23,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:23,990 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:23,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:35:23,991 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:23,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:23,992 INFO L85 PathProgramCache]: Analyzing trace with hash -761854790, now seen corresponding path program 1 times [2025-02-05 11:35:23,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:23,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488425036] [2025-02-05 11:35:23,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:23,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:24,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-02-05 11:35:24,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-02-05 11:35:24,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:24,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:24,255 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 516 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-02-05 11:35:24,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:24,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488425036] [2025-02-05 11:35:24,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488425036] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:24,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:35:24,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:35:24,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031096333] [2025-02-05 11:35:24,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:24,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:35:24,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:24,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:35:24,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:35:24,257 INFO L87 Difference]: Start difference. First operand 39807 states and 44622 transitions. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have 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:35:27,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:27,112 INFO L93 Difference]: Finished difference Result 98387 states and 111521 transitions. [2025-02-05 11:35:27,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:35:27,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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 442 [2025-02-05 11:35:27,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:27,184 INFO L225 Difference]: With dead ends: 98387 [2025-02-05 11:35:27,184 INFO L226 Difference]: Without dead ends: 59333 [2025-02-05 11:35:27,203 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:35:27,204 INFO L435 NwaCegarLoop]: 1085 mSDtfsCounter, 799 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2107 mSolverCounterSat, 781 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 2888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 781 IncrementalHoareTripleChecker+Valid, 2107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:27,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 1092 Invalid, 2888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [781 Valid, 2107 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:35:27,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59333 states. [2025-02-05 11:35:27,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59333 to 55578. [2025-02-05 11:35:27,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55578 states, 55577 states have (on average 1.125807438328805) internal successors, (62569), 55577 states have internal predecessors, (62569), 0 states have call successors, (0), 0 states have 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:35:27,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55578 states to 55578 states and 62569 transitions. [2025-02-05 11:35:27,958 INFO L78 Accepts]: Start accepts. Automaton has 55578 states and 62569 transitions. Word has length 442 [2025-02-05 11:35:27,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:27,959 INFO L471 AbstractCegarLoop]: Abstraction has 55578 states and 62569 transitions. [2025-02-05 11:35:27,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have 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:35:27,959 INFO L276 IsEmpty]: Start isEmpty. Operand 55578 states and 62569 transitions. [2025-02-05 11:35:27,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-02-05 11:35:27,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:27,976 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:35:27,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:35:27,977 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:27,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:27,977 INFO L85 PathProgramCache]: Analyzing trace with hash 192134795, now seen corresponding path program 1 times [2025-02-05 11:35:27,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:27,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815345166] [2025-02-05 11:35:27,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:27,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:28,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-02-05 11:35:28,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-02-05 11:35:28,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:28,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:28,302 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2025-02-05 11:35:28,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:28,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815345166] [2025-02-05 11:35:28,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815345166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:28,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:35:28,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:35:28,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834651048] [2025-02-05 11:35:28,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:28,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:35:28,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:28,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:35:28,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:35:28,304 INFO L87 Difference]: Start difference. First operand 55578 states and 62569 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have 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:35:30,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:30,820 INFO L93 Difference]: Finished difference Result 124672 states and 140754 transitions. [2025-02-05 11:35:30,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:35:30,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 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 459 [2025-02-05 11:35:30,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:30,890 INFO L225 Difference]: With dead ends: 124672 [2025-02-05 11:35:30,890 INFO L226 Difference]: Without dead ends: 69847 [2025-02-05 11:35:30,916 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:35:30,917 INFO L435 NwaCegarLoop]: 1112 mSDtfsCounter, 825 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2177 mSolverCounterSat, 426 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 2603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 426 IncrementalHoareTripleChecker+Valid, 2177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:30,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 1120 Invalid, 2603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [426 Valid, 2177 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 11:35:30,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69847 states. [2025-02-05 11:35:31,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69847 to 69847. [2025-02-05 11:35:31,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69847 states, 69846 states have (on average 1.117229333104258) internal successors, (78034), 69846 states have internal predecessors, (78034), 0 states have call successors, (0), 0 states have 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:35:31,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69847 states to 69847 states and 78034 transitions. [2025-02-05 11:35:31,920 INFO L78 Accepts]: Start accepts. Automaton has 69847 states and 78034 transitions. Word has length 459 [2025-02-05 11:35:31,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:31,921 INFO L471 AbstractCegarLoop]: Abstraction has 69847 states and 78034 transitions. [2025-02-05 11:35:31,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have 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:35:31,921 INFO L276 IsEmpty]: Start isEmpty. Operand 69847 states and 78034 transitions. [2025-02-05 11:35:31,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2025-02-05 11:35:31,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:31,942 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:31,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:35:31,943 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:31,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:31,943 INFO L85 PathProgramCache]: Analyzing trace with hash 657497280, now seen corresponding path program 1 times [2025-02-05 11:35:31,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:31,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30431704] [2025-02-05 11:35:31,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:31,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:31,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 618 statements into 1 equivalence classes. [2025-02-05 11:35:32,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 618 of 618 statements. [2025-02-05 11:35:32,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:32,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:32,493 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 688 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-02-05 11:35:32,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:32,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30431704] [2025-02-05 11:35:32,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30431704] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:32,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:35:32,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:35:32,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131994250] [2025-02-05 11:35:32,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:32,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:35:32,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:32,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:35:32,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:35:32,496 INFO L87 Difference]: Start difference. First operand 69847 states and 78034 transitions. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have 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:35:35,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:35,461 INFO L93 Difference]: Finished difference Result 154712 states and 174695 transitions. [2025-02-05 11:35:35,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:35:35,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 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 618 [2025-02-05 11:35:35,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:35,563 INFO L225 Difference]: With dead ends: 154712 [2025-02-05 11:35:35,563 INFO L226 Difference]: Without dead ends: 85618 [2025-02-05 11:35:35,602 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:35:35,603 INFO L435 NwaCegarLoop]: 1283 mSDtfsCounter, 668 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2242 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 2688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 2242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:35,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1291 Invalid, 2688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 2242 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:35:35,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85618 states. [2025-02-05 11:35:36,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85618 to 84116. [2025-02-05 11:35:36,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84116 states, 84115 states have (on average 1.1083873268739226) internal successors, (93232), 84115 states have internal predecessors, (93232), 0 states have call successors, (0), 0 states have 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:35:37,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84116 states to 84116 states and 93232 transitions. [2025-02-05 11:35:37,012 INFO L78 Accepts]: Start accepts. Automaton has 84116 states and 93232 transitions. Word has length 618 [2025-02-05 11:35:37,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:37,013 INFO L471 AbstractCegarLoop]: Abstraction has 84116 states and 93232 transitions. [2025-02-05 11:35:37,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have 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:35:37,013 INFO L276 IsEmpty]: Start isEmpty. Operand 84116 states and 93232 transitions. [2025-02-05 11:35:37,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-02-05 11:35:37,031 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:37,031 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:37,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:35:37,031 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:37,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:37,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1255777724, now seen corresponding path program 1 times [2025-02-05 11:35:37,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:37,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119076468] [2025-02-05 11:35:37,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:37,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:37,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-02-05 11:35:37,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-02-05 11:35:37,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:37,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:38,115 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 464 proven. 45 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-02-05 11:35:38,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:38,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119076468] [2025-02-05 11:35:38,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119076468] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:35:38,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836438519] [2025-02-05 11:35:38,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:38,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:35:38,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:35:38,119 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:35:38,120 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:35:38,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-02-05 11:35:38,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-02-05 11:35:38,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:38,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:38,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:35:38,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:35:38,896 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 509 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-02-05 11:35:38,897 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:35:38,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836438519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:38,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:35:38,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 11:35:38,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650896342] [2025-02-05 11:35:38,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:38,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:35:38,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:38,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:35:38,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:35:38,898 INFO L87 Difference]: Start difference. First operand 84116 states and 93232 transitions. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have 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:35:41,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:41,151 INFO L93 Difference]: Finished difference Result 169732 states and 187990 transitions. [2025-02-05 11:35:41,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:35:41,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 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 642 [2025-02-05 11:35:41,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:41,241 INFO L225 Difference]: With dead ends: 169732 [2025-02-05 11:35:41,241 INFO L226 Difference]: Without dead ends: 81863 [2025-02-05 11:35:41,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 642 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:35:41,287 INFO L435 NwaCegarLoop]: 1334 mSDtfsCounter, 500 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2095 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 2322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 2095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:41,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 1342 Invalid, 2322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 2095 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 11:35:41,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81863 states. [2025-02-05 11:35:42,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81863 to 80361. [2025-02-05 11:35:42,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80361 states, 80360 states have (on average 1.1045669487307117) internal successors, (88763), 80360 states have internal predecessors, (88763), 0 states have call successors, (0), 0 states have 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:35:42,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80361 states to 80361 states and 88763 transitions. [2025-02-05 11:35:42,236 INFO L78 Accepts]: Start accepts. Automaton has 80361 states and 88763 transitions. Word has length 642 [2025-02-05 11:35:42,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:42,236 INFO L471 AbstractCegarLoop]: Abstraction has 80361 states and 88763 transitions. [2025-02-05 11:35:42,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have 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:35:42,237 INFO L276 IsEmpty]: Start isEmpty. Operand 80361 states and 88763 transitions. [2025-02-05 11:35:42,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-02-05 11:35:42,257 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:42,257 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:42,263 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:35:42,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:35:42,462 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:42,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:42,463 INFO L85 PathProgramCache]: Analyzing trace with hash 561815918, now seen corresponding path program 1 times [2025-02-05 11:35:42,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:42,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453020178] [2025-02-05 11:35:42,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:42,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:42,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-02-05 11:35:42,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-02-05 11:35:42,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:42,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 365 proven. 372 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 11:35:43,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:43,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453020178] [2025-02-05 11:35:43,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453020178] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:35:43,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722988656] [2025-02-05 11:35:43,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:43,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:35:43,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:35:43,521 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:35:43,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:35:43,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-02-05 11:35:43,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-02-05 11:35:43,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:43,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:43,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:35:43,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:35:44,535 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 583 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-02-05 11:35:44,535 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:35:44,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722988656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:44,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:35:44,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 11:35:44,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566039990] [2025-02-05 11:35:44,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:44,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:35:44,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:44,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:35:44,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:35:44,537 INFO L87 Difference]: Start difference. First operand 80361 states and 88763 transitions. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have 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:35:47,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:47,355 INFO L93 Difference]: Finished difference Result 189258 states and 210747 transitions. [2025-02-05 11:35:47,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:35:47,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 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 643 [2025-02-05 11:35:47,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:47,465 INFO L225 Difference]: With dead ends: 189258 [2025-02-05 11:35:47,465 INFO L226 Difference]: Without dead ends: 109650 [2025-02-05 11:35:47,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 642 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:35:47,520 INFO L435 NwaCegarLoop]: 1320 mSDtfsCounter, 493 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2257 mSolverCounterSat, 472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 2729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 472 IncrementalHoareTripleChecker+Valid, 2257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:47,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 1328 Invalid, 2729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [472 Valid, 2257 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 11:35:47,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109650 states. [2025-02-05 11:35:48,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109650 to 106646. [2025-02-05 11:35:48,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106646 states, 106645 states have (on average 1.09197805804304) internal successors, (116454), 106645 states have internal predecessors, (116454), 0 states have call successors, (0), 0 states have 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:35:48,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106646 states to 106646 states and 116454 transitions. [2025-02-05 11:35:48,783 INFO L78 Accepts]: Start accepts. Automaton has 106646 states and 116454 transitions. Word has length 643 [2025-02-05 11:35:48,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:48,784 INFO L471 AbstractCegarLoop]: Abstraction has 106646 states and 116454 transitions. [2025-02-05 11:35:48,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have 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:35:48,784 INFO L276 IsEmpty]: Start isEmpty. Operand 106646 states and 116454 transitions. [2025-02-05 11:35:48,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2025-02-05 11:35:48,810 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:48,810 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:48,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 11:35:49,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-05 11:35:49,014 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:49,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:49,014 INFO L85 PathProgramCache]: Analyzing trace with hash 524221511, now seen corresponding path program 1 times [2025-02-05 11:35:49,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:49,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808615880] [2025-02-05 11:35:49,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:49,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:49,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-02-05 11:35:49,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-02-05 11:35:49,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:49,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 531 proven. 14 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-02-05 11:35:49,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:49,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808615880] [2025-02-05 11:35:49,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808615880] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:35:49,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814683517] [2025-02-05 11:35:49,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:49,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:35:49,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:35:49,694 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:35:49,697 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:35:49,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-02-05 11:35:49,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-02-05 11:35:49,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:49,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:49,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:35:49,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:35:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 531 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2025-02-05 11:35:50,283 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:35:50,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814683517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:50,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:35:50,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-02-05 11:35:50,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164288949] [2025-02-05 11:35:50,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:50,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:35:50,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:50,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:35:50,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:35:50,285 INFO L87 Difference]: Start difference. First operand 106646 states and 116454 transitions. Second operand has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 2 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:35:53,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:53,400 INFO L93 Difference]: Finished difference Result 212539 states and 232150 transitions. [2025-02-05 11:35:53,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:35:53,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 2 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 709 [2025-02-05 11:35:53,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:53,525 INFO L225 Difference]: With dead ends: 212539 [2025-02-05 11:35:53,526 INFO L226 Difference]: Without dead ends: 106646 [2025-02-05 11:35:53,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 708 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:35:53,571 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 634 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2205 mSolverCounterSat, 461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 461 IncrementalHoareTripleChecker+Valid, 2205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:53,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 409 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [461 Valid, 2205 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:35:53,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106646 states. [2025-02-05 11:35:54,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106646 to 106646. [2025-02-05 11:35:54,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106646 states, 106645 states have (on average 1.0658352477847062) internal successors, (113666), 106645 states have internal predecessors, (113666), 0 states have call successors, (0), 0 states have 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:35:54,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106646 states to 106646 states and 113666 transitions. [2025-02-05 11:35:54,476 INFO L78 Accepts]: Start accepts. Automaton has 106646 states and 113666 transitions. Word has length 709 [2025-02-05 11:35:54,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:54,476 INFO L471 AbstractCegarLoop]: Abstraction has 106646 states and 113666 transitions. [2025-02-05 11:35:54,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 2 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:35:54,476 INFO L276 IsEmpty]: Start isEmpty. Operand 106646 states and 113666 transitions. [2025-02-05 11:35:54,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 720 [2025-02-05 11:35:54,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:54,491 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:54,497 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:35:54,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 11:35:54,692 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:54,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:54,693 INFO L85 PathProgramCache]: Analyzing trace with hash 2141133024, now seen corresponding path program 1 times [2025-02-05 11:35:54,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:54,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862065603] [2025-02-05 11:35:54,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:54,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:54,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 719 statements into 1 equivalence classes. [2025-02-05 11:35:54,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 719 of 719 statements. [2025-02-05 11:35:54,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:54,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:35:55,461 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 586 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-02-05 11:35:55,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:35:55,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862065603] [2025-02-05 11:35:55,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862065603] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:35:55,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:35:55,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:35:55,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110045021] [2025-02-05 11:35:55,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:35:55,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:35:55,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:35:55,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:35:55,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:35:55,463 INFO L87 Difference]: Start difference. First operand 106646 states and 113666 transitions. Second operand has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have 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:35:57,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:35:57,720 INFO L93 Difference]: Finished difference Result 214792 states and 228859 transitions. [2025-02-05 11:35:57,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:35:57,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 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 719 [2025-02-05 11:35:57,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:35:57,859 INFO L225 Difference]: With dead ends: 214792 [2025-02-05 11:35:57,859 INFO L226 Difference]: Without dead ends: 107397 [2025-02-05 11:35:57,920 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:35:57,923 INFO L435 NwaCegarLoop]: 1308 mSDtfsCounter, 492 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2281 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 2350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:35:57,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 1315 Invalid, 2350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2281 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 11:35:58,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107397 states. [2025-02-05 11:35:58,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107397 to 106646. [2025-02-05 11:35:58,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106646 states, 106645 states have (on average 1.0646068732711331) internal successors, (113535), 106645 states have internal predecessors, (113535), 0 states have call successors, (0), 0 states have 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:35:59,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106646 states to 106646 states and 113535 transitions. [2025-02-05 11:35:59,073 INFO L78 Accepts]: Start accepts. Automaton has 106646 states and 113535 transitions. Word has length 719 [2025-02-05 11:35:59,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:35:59,074 INFO L471 AbstractCegarLoop]: Abstraction has 106646 states and 113535 transitions. [2025-02-05 11:35:59,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have 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:35:59,074 INFO L276 IsEmpty]: Start isEmpty. Operand 106646 states and 113535 transitions. [2025-02-05 11:35:59,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 726 [2025-02-05 11:35:59,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:35:59,092 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:35:59,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 11:35:59,092 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:35:59,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:35:59,093 INFO L85 PathProgramCache]: Analyzing trace with hash -2035507089, now seen corresponding path program 1 times [2025-02-05 11:35:59,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:35:59,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381915067] [2025-02-05 11:35:59,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:35:59,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:35:59,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 725 statements into 1 equivalence classes. [2025-02-05 11:35:59,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 725 of 725 statements. [2025-02-05 11:35:59,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:35:59,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:00,219 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 451 proven. 360 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-02-05 11:36:00,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:36:00,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381915067] [2025-02-05 11:36:00,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381915067] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:36:00,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688106582] [2025-02-05 11:36:00,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:00,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:36:00,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:36:00,221 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:36:00,223 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:36:00,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 725 statements into 1 equivalence classes. [2025-02-05 11:36:00,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 725 of 725 statements. [2025-02-05 11:36:00,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:00,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:00,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 11:36:00,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:36:01,175 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 592 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-02-05 11:36:01,175 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:36:01,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688106582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:36:01,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:36:01,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 11:36:01,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581807506] [2025-02-05 11:36:01,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:36:01,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:36:01,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:36:01,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:36:01,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:36:01,176 INFO L87 Difference]: Start difference. First operand 106646 states and 113535 transitions. Second operand has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have 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:36:03,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:36:03,704 INFO L93 Difference]: Finished difference Result 213290 states and 227066 transitions. [2025-02-05 11:36:03,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:36:03,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 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 725 [2025-02-05 11:36:03,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:36:03,854 INFO L225 Difference]: With dead ends: 213290 [2025-02-05 11:36:03,855 INFO L226 Difference]: Without dead ends: 106646 [2025-02-05 11:36:03,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 730 GetRequests, 725 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:36:03,930 INFO L435 NwaCegarLoop]: 1354 mSDtfsCounter, 489 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2020 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 2182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 2020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:36:03,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 1362 Invalid, 2182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 2020 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 11:36:04,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106646 states. [2025-02-05 11:36:05,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106646 to 105895. [2025-02-05 11:36:05,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105895 states, 105894 states have (on average 1.0603150320131451) internal successors, (112281), 105894 states have internal predecessors, (112281), 0 states have call successors, (0), 0 states have 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:36:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105895 states to 105895 states and 112281 transitions. [2025-02-05 11:36:05,311 INFO L78 Accepts]: Start accepts. Automaton has 105895 states and 112281 transitions. Word has length 725 [2025-02-05 11:36:05,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:36:05,311 INFO L471 AbstractCegarLoop]: Abstraction has 105895 states and 112281 transitions. [2025-02-05 11:36:05,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have 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:36:05,312 INFO L276 IsEmpty]: Start isEmpty. Operand 105895 states and 112281 transitions. [2025-02-05 11:36:05,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 776 [2025-02-05 11:36:05,354 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:36:05,355 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:05,364 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:36:05,555 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,SelfDestructingSolverStorable16 [2025-02-05 11:36:05,556 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:36:05,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:36:05,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1897840248, now seen corresponding path program 1 times [2025-02-05 11:36:05,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:36:05,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154514507] [2025-02-05 11:36:05,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:05,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:36:05,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 775 statements into 1 equivalence classes. [2025-02-05 11:36:05,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 775 of 775 statements. [2025-02-05 11:36:05,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:05,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:06,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 597 proven. 45 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-02-05 11:36:06,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:36:06,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154514507] [2025-02-05 11:36:06,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154514507] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:36:06,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112911755] [2025-02-05 11:36:06,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:36:06,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:36:06,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:36:06,891 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:36:06,892 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:36:06,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 775 statements into 1 equivalence classes. [2025-02-05 11:36:07,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 775 of 775 statements. [2025-02-05 11:36:07,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:36:07,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:36:07,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 11:36:07,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:36:07,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-02-05 11:36:07,901 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:36:07,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112911755] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:36:07,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:36:07,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 11:36:07,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548538947] [2025-02-05 11:36:07,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:36:07,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:36:07,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:36:07,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:36:07,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:36:07,903 INFO L87 Difference]: Start difference. First operand 105895 states and 112281 transitions. Second operand has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have 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:36:10,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:36:10,196 INFO L93 Difference]: Finished difference Result 211037 states and 223804 transitions. [2025-02-05 11:36:10,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:36:10,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 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 775 [2025-02-05 11:36:10,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:36:10,339 INFO L225 Difference]: With dead ends: 211037 [2025-02-05 11:36:10,340 INFO L226 Difference]: Without dead ends: 105895 [2025-02-05 11:36:10,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 775 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:36:10,402 INFO L435 NwaCegarLoop]: 1308 mSDtfsCounter, 489 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2192 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 2270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 2192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:36:10,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 1316 Invalid, 2270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 2192 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 11:36:10,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105895 states. [2025-02-05 11:36:11,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105895 to 105895. [2025-02-05 11:36:11,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105895 states, 105894 states have (on average 1.0585018981245395) internal successors, (112089), 105894 states have internal predecessors, (112089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)