./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label36.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_label36.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 8cfcc97b5952aa72da47fe0e4e97f4617137d46f4db9024e30e3a5a5c97f7e95 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:38:20,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:38:20,568 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:38:20,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:38:20,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:38:20,586 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:38:20,586 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:38:20,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:38:20,587 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:38:20,587 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:38:20,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:38:20,587 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:38:20,587 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:38:20,587 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:38:20,587 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:38:20,587 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:38:20,587 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:38:20,587 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:38:20,588 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:38:20,588 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:38:20,588 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:38:20,588 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:38:20,588 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:38:20,588 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:38:20,588 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:38:20,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:38:20,588 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:38:20,588 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:38:20,588 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:38:20,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:38:20,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:38:20,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:38:20,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:38:20,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:38:20,589 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:38:20,589 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:38:20,589 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:38:20,589 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:38:20,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:38:20,589 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:38:20,589 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:38:20,590 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:38:20,590 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:38:20,590 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 -> 8cfcc97b5952aa72da47fe0e4e97f4617137d46f4db9024e30e3a5a5c97f7e95 [2025-02-05 11:38:20,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:38:20,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:38:20,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:38:20,831 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:38:20,831 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:38:20,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label36.c [2025-02-05 11:38:21,984 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f5133e126/840b032640d64d86b4c32ca8cafad93e/FLAGc3836cb9b [2025-02-05 11:38:22,506 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:38:22,507 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label36.c [2025-02-05 11:38:22,538 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f5133e126/840b032640d64d86b4c32ca8cafad93e/FLAGc3836cb9b [2025-02-05 11:38:22,554 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f5133e126/840b032640d64d86b4c32ca8cafad93e [2025-02-05 11:38:22,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:38:22,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:38:22,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:38:22,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:38:22,563 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:38:22,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:38:22" (1/1) ... [2025-02-05 11:38:22,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30f0f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:22, skipping insertion in model container [2025-02-05 11:38:22,564 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:38:22" (1/1) ... [2025-02-05 11:38:22,651 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:38:22,847 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_label36.c[7066,7079] [2025-02-05 11:38:23,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:38:23,272 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:38:23,285 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_label36.c[7066,7079] [2025-02-05 11:38:23,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:38:23,524 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:38:23,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:23 WrapperNode [2025-02-05 11:38:23,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:38:23,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:38:23,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:38:23,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:38:23,529 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:38:23" (1/1) ... [2025-02-05 11:38:23,559 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:38:23" (1/1) ... [2025-02-05 11:38:23,789 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-02-05 11:38:23,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:38:23,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:38:23,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:38:23,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:38:23,796 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:23" (1/1) ... [2025-02-05 11:38:23,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:23" (1/1) ... [2025-02-05 11:38:23,827 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:23" (1/1) ... [2025-02-05 11:38:23,934 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:38:23,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:23" (1/1) ... [2025-02-05 11:38:23,935 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:23" (1/1) ... [2025-02-05 11:38:24,024 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:23" (1/1) ... [2025-02-05 11:38:24,042 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:23" (1/1) ... [2025-02-05 11:38:24,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:23" (1/1) ... [2025-02-05 11:38:24,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:23" (1/1) ... [2025-02-05 11:38:24,116 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:38:24,142 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:38:24,142 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:38:24,142 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:38:24,143 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:23" (1/1) ... [2025-02-05 11:38:24,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:38:24,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:38:24,169 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:38:24,174 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:38:24,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:38:24,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:38:24,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:38:24,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:38:24,237 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:38:24,239 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:38:27,617 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-02-05 11:38:27,618 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-02-05 11:38:27,618 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-02-05 11:38:27,785 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-02-05 11:38:27,785 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:38:27,815 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:38:27,815 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:38:27,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:38:27 BoogieIcfgContainer [2025-02-05 11:38:27,816 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:38:27,817 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:38:27,817 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:38:27,823 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:38:27,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:38:22" (1/3) ... [2025-02-05 11:38:27,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34d7331a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:38:27, skipping insertion in model container [2025-02-05 11:38:27,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:23" (2/3) ... [2025-02-05 11:38:27,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34d7331a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:38:27, skipping insertion in model container [2025-02-05 11:38:27,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:38:27" (3/3) ... [2025-02-05 11:38:27,825 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label36.c [2025-02-05 11:38:27,838 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:38:27,839 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label36.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:38:27,911 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:38:27,920 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;@3e1b7648, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:38:27,921 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:38:27,927 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:38:27,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 11:38:27,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:27,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:38:27,935 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:27,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:27,940 INFO L85 PathProgramCache]: Analyzing trace with hash 743382500, now seen corresponding path program 1 times [2025-02-05 11:38:27,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:27,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719849004] [2025-02-05 11:38:27,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:27,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:28,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 11:38:28,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 11:38:28,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:28,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:28,242 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:38:28,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:28,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719849004] [2025-02-05 11:38:28,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719849004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:28,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:28,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:38:28,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593735530] [2025-02-05 11:38:28,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:28,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:38:28,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:28,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:38:28,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:38:28,278 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 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:31,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:31,078 INFO L93 Difference]: Finished difference Result 2388 states and 4626 transitions. [2025-02-05 11:38:31,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:38:31,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-02-05 11:38:31,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:31,097 INFO L225 Difference]: With dead ends: 2388 [2025-02-05 11:38:31,097 INFO L226 Difference]: Without dead ends: 1506 [2025-02-05 11:38:31,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:38:31,107 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 777 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:31,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 481 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 11:38:31,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-02-05 11:38:31,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-02-05 11:38:31,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.6385382059800664) internal successors, (2466), 1505 states have internal predecessors, (2466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:31,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2466 transitions. [2025-02-05 11:38:31,223 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2466 transitions. Word has length 57 [2025-02-05 11:38:31,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:31,227 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2466 transitions. [2025-02-05 11:38:31,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:31,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2466 transitions. [2025-02-05 11:38:31,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 11:38:31,230 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:31,230 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, 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] [2025-02-05 11:38:31,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:38:31,231 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:31,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:31,231 INFO L85 PathProgramCache]: Analyzing trace with hash 845745249, now seen corresponding path program 1 times [2025-02-05 11:38:31,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:31,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76969361] [2025-02-05 11:38:31,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:31,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:31,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 11:38:31,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 11:38:31,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:31,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:38:31,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:31,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76969361] [2025-02-05 11:38:31,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76969361] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:31,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:31,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:38:31,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803584608] [2025-02-05 11:38:31,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:31,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:38:31,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:31,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:38:31,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:38:31,587 INFO L87 Difference]: Start difference. First operand 1506 states and 2466 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:34,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:34,828 INFO L93 Difference]: Finished difference Result 4551 states and 7431 transitions. [2025-02-05 11:38:34,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:38:34,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2025-02-05 11:38:34,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:34,838 INFO L225 Difference]: With dead ends: 4551 [2025-02-05 11:38:34,838 INFO L226 Difference]: Without dead ends: 3010 [2025-02-05 11:38:34,840 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:38:34,841 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 705 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3076 mSolverCounterSat, 728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 3804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 728 IncrementalHoareTripleChecker+Valid, 3076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:34,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 654 Invalid, 3804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [728 Valid, 3076 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-05 11:38:34,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2025-02-05 11:38:34,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 3008. [2025-02-05 11:38:34,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.3418689723977386) internal successors, (4035), 3007 states have internal predecessors, (4035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:34,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4035 transitions. [2025-02-05 11:38:34,888 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4035 transitions. Word has length 128 [2025-02-05 11:38:34,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:34,888 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4035 transitions. [2025-02-05 11:38:34,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:34,888 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4035 transitions. [2025-02-05 11:38:34,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 11:38:34,890 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:34,890 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, 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] [2025-02-05 11:38:34,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:38:34,890 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:34,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:34,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1992008480, now seen corresponding path program 1 times [2025-02-05 11:38:34,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:34,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41990669] [2025-02-05 11:38:34,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:34,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:34,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 11:38:34,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 11:38:34,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:34,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:35,192 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:38:35,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:35,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41990669] [2025-02-05 11:38:35,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41990669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:35,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:35,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:38:35,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791801469] [2025-02-05 11:38:35,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:35,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:38:35,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:35,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:38:35,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:38:35,195 INFO L87 Difference]: Start difference. First operand 3008 states and 4035 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:39,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:39,201 INFO L93 Difference]: Finished difference Result 9769 states and 12895 transitions. [2025-02-05 11:38:39,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:38:39,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-02-05 11:38:39,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:39,218 INFO L225 Difference]: With dead ends: 9769 [2025-02-05 11:38:39,219 INFO L226 Difference]: Without dead ends: 6763 [2025-02-05 11:38:39,222 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:38:39,222 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 2094 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 4274 mSolverCounterSat, 567 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2094 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 4841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 567 IncrementalHoareTripleChecker+Valid, 4274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:39,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2094 Valid, 451 Invalid, 4841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [567 Valid, 4274 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-02-05 11:38:39,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2025-02-05 11:38:39,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6763. [2025-02-05 11:38:39,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6763 states, 6762 states have (on average 1.2877846790890268) internal successors, (8708), 6762 states have internal predecessors, (8708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:39,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6763 states to 6763 states and 8708 transitions. [2025-02-05 11:38:39,305 INFO L78 Accepts]: Start accepts. Automaton has 6763 states and 8708 transitions. Word has length 166 [2025-02-05 11:38:39,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:39,306 INFO L471 AbstractCegarLoop]: Abstraction has 6763 states and 8708 transitions. [2025-02-05 11:38:39,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:39,306 INFO L276 IsEmpty]: Start isEmpty. Operand 6763 states and 8708 transitions. [2025-02-05 11:38:39,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-02-05 11:38:39,308 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:39,308 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:39,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:38:39,308 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:39,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:39,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1565739413, now seen corresponding path program 1 times [2025-02-05 11:38:39,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:39,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183592211] [2025-02-05 11:38:39,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:39,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:39,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-02-05 11:38:39,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-02-05 11:38:39,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:39,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:39,759 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-05 11:38:39,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:39,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183592211] [2025-02-05 11:38:39,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183592211] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:39,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:39,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:38:39,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560489660] [2025-02-05 11:38:39,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:39,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:38:39,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:39,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:38:39,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:38:39,761 INFO L87 Difference]: Start difference. First operand 6763 states and 8708 transitions. Second operand has 4 states, 4 states have (on average 50.0) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:42,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:42,663 INFO L93 Difference]: Finished difference Result 15816 states and 21400 transitions. [2025-02-05 11:38:42,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:38:42,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 269 [2025-02-05 11:38:42,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:42,707 INFO L225 Difference]: With dead ends: 15816 [2025-02-05 11:38:42,708 INFO L226 Difference]: Without dead ends: 9769 [2025-02-05 11:38:42,719 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:38:42,720 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 850 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3465 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 4018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 3465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:42,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 494 Invalid, 4018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 3465 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 11:38:42,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9769 states. [2025-02-05 11:38:42,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9769 to 9767. [2025-02-05 11:38:42,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.2733975015359411) internal successors, (12436), 9766 states have internal predecessors, (12436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:42,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 12436 transitions. [2025-02-05 11:38:42,849 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 12436 transitions. Word has length 269 [2025-02-05 11:38:42,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:42,850 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 12436 transitions. [2025-02-05 11:38:42,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:42,851 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 12436 transitions. [2025-02-05 11:38:42,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-02-05 11:38:42,853 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:42,853 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:42,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:38:42,854 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:42,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:42,854 INFO L85 PathProgramCache]: Analyzing trace with hash -200150968, now seen corresponding path program 1 times [2025-02-05 11:38:42,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:42,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552065216] [2025-02-05 11:38:42,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:42,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:42,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-05 11:38:42,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-05 11:38:42,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:42,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:43,103 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-02-05 11:38:43,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:43,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552065216] [2025-02-05 11:38:43,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552065216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:43,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:43,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:38:43,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122203929] [2025-02-05 11:38:43,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:43,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:38:43,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:43,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:38:43,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:38:43,105 INFO L87 Difference]: Start difference. First operand 9767 states and 12436 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:45,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:45,464 INFO L93 Difference]: Finished difference Result 26291 states and 34162 transitions. [2025-02-05 11:38:45,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:38:45,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 272 [2025-02-05 11:38:45,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:45,496 INFO L225 Difference]: With dead ends: 26291 [2025-02-05 11:38:45,496 INFO L226 Difference]: Without dead ends: 17277 [2025-02-05 11:38:45,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:38:45,506 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 619 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2021 mSolverCounterSat, 794 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 2815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 794 IncrementalHoareTripleChecker+Valid, 2021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:45,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 598 Invalid, 2815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [794 Valid, 2021 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 11:38:45,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17277 states. [2025-02-05 11:38:45,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17277 to 17277. [2025-02-05 11:38:45,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17277 states, 17276 states have (on average 1.1980203750868257) internal successors, (20697), 17276 states have internal predecessors, (20697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:45,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17277 states to 17277 states and 20697 transitions. [2025-02-05 11:38:45,704 INFO L78 Accepts]: Start accepts. Automaton has 17277 states and 20697 transitions. Word has length 272 [2025-02-05 11:38:45,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:45,704 INFO L471 AbstractCegarLoop]: Abstraction has 17277 states and 20697 transitions. [2025-02-05 11:38:45,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:45,705 INFO L276 IsEmpty]: Start isEmpty. Operand 17277 states and 20697 transitions. [2025-02-05 11:38:45,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-02-05 11:38:45,709 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:45,710 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:45,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:38:45,710 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:45,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:45,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1894438350, now seen corresponding path program 1 times [2025-02-05 11:38:45,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:45,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999939685] [2025-02-05 11:38:45,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:45,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:45,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-02-05 11:38:45,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-02-05 11:38:45,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:45,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:46,151 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 41 proven. 139 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 11:38:46,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:46,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999939685] [2025-02-05 11:38:46,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999939685] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:38:46,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134608556] [2025-02-05 11:38:46,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:46,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:38:46,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:38:46,161 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:38:46,169 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:38:46,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-02-05 11:38:46,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-02-05 11:38:46,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:46,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:46,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:38:46,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:38:46,412 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-05 11:38:46,413 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:38:46,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134608556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:46,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:38:46,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 11:38:46,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628701374] [2025-02-05 11:38:46,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:46,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:38:46,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:46,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:38:46,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:38:46,415 INFO L87 Difference]: Start difference. First operand 17277 states and 20697 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:49,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:49,026 INFO L93 Difference]: Finished difference Result 45066 states and 55029 transitions. [2025-02-05 11:38:49,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:38:49,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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 287 [2025-02-05 11:38:49,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:49,072 INFO L225 Difference]: With dead ends: 45066 [2025-02-05 11:38:49,073 INFO L226 Difference]: Without dead ends: 28542 [2025-02-05 11:38:49,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:38:49,090 INFO L435 NwaCegarLoop]: 921 mSDtfsCounter, 759 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2269 mSolverCounterSat, 743 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 3012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 743 IncrementalHoareTripleChecker+Valid, 2269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:49,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 929 Invalid, 3012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [743 Valid, 2269 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:38:49,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28542 states. [2025-02-05 11:38:49,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28542 to 27040. [2025-02-05 11:38:49,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27040 states, 27039 states have (on average 1.2244905506860462) internal successors, (33109), 27039 states have internal predecessors, (33109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:49,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27040 states to 27040 states and 33109 transitions. [2025-02-05 11:38:49,376 INFO L78 Accepts]: Start accepts. Automaton has 27040 states and 33109 transitions. Word has length 287 [2025-02-05 11:38:49,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:49,377 INFO L471 AbstractCegarLoop]: Abstraction has 27040 states and 33109 transitions. [2025-02-05 11:38:49,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:49,377 INFO L276 IsEmpty]: Start isEmpty. Operand 27040 states and 33109 transitions. [2025-02-05 11:38:49,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-02-05 11:38:49,380 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:49,380 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:49,386 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:38:49,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:38:49,581 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:49,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:49,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2102974235, now seen corresponding path program 1 times [2025-02-05 11:38:49,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:49,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823913454] [2025-02-05 11:38:49,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:49,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:49,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-02-05 11:38:49,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-02-05 11:38:49,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:49,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:49,728 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-02-05 11:38:49,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:49,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823913454] [2025-02-05 11:38:49,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823913454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:49,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:49,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:38:49,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63936867] [2025-02-05 11:38:49,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:49,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:38:49,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:49,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:38:49,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:38:49,730 INFO L87 Difference]: Start difference. First operand 27040 states and 33109 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:52,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:52,254 INFO L93 Difference]: Finished difference Result 66845 states and 83232 transitions. [2025-02-05 11:38:52,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:38:52,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 297 [2025-02-05 11:38:52,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:52,358 INFO L225 Difference]: With dead ends: 66845 [2025-02-05 11:38:52,358 INFO L226 Difference]: Without dead ends: 40558 [2025-02-05 11:38:52,374 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:38:52,374 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 790 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2248 mSolverCounterSat, 630 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 2878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 630 IncrementalHoareTripleChecker+Valid, 2248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:52,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 308 Invalid, 2878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [630 Valid, 2248 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 11:38:52,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40558 states. [2025-02-05 11:38:52,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40558 to 38305. [2025-02-05 11:38:52,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38305 states, 38304 states have (on average 1.2380430242272347) internal successors, (47422), 38304 states have internal predecessors, (47422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:52,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38305 states to 38305 states and 47422 transitions. [2025-02-05 11:38:52,710 INFO L78 Accepts]: Start accepts. Automaton has 38305 states and 47422 transitions. Word has length 297 [2025-02-05 11:38:52,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:52,710 INFO L471 AbstractCegarLoop]: Abstraction has 38305 states and 47422 transitions. [2025-02-05 11:38:52,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:52,710 INFO L276 IsEmpty]: Start isEmpty. Operand 38305 states and 47422 transitions. [2025-02-05 11:38:52,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-02-05 11:38:52,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:52,714 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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:38:52,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:38:52,714 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:52,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:52,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1822333784, now seen corresponding path program 1 times [2025-02-05 11:38:52,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:52,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837599176] [2025-02-05 11:38:52,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:52,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:52,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-02-05 11:38:52,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-02-05 11:38:52,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:52,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:52,891 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:38:52,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:52,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837599176] [2025-02-05 11:38:52,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837599176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:52,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:52,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:38:52,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341050795] [2025-02-05 11:38:52,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:52,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:38:52,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:52,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:38:52,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:38:52,893 INFO L87 Difference]: Start difference. First operand 38305 states and 47422 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:55,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:55,899 INFO L93 Difference]: Finished difference Result 93130 states and 115555 transitions. [2025-02-05 11:38:55,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:38:55,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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 315 [2025-02-05 11:38:55,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:55,964 INFO L225 Difference]: With dead ends: 93130 [2025-02-05 11:38:55,965 INFO L226 Difference]: Without dead ends: 55578 [2025-02-05 11:38:55,989 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:38:55,990 INFO L435 NwaCegarLoop]: 1328 mSDtfsCounter, 637 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2683 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 2995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 2683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:55,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1336 Invalid, 2995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 2683 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 11:38:56,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55578 states. [2025-02-05 11:38:56,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55578 to 53325. [2025-02-05 11:38:56,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53325 states, 53324 states have (on average 1.2311904583302078) internal successors, (65652), 53324 states have internal predecessors, (65652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:56,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53325 states to 53325 states and 65652 transitions. [2025-02-05 11:38:56,632 INFO L78 Accepts]: Start accepts. Automaton has 53325 states and 65652 transitions. Word has length 315 [2025-02-05 11:38:56,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:56,633 INFO L471 AbstractCegarLoop]: Abstraction has 53325 states and 65652 transitions. [2025-02-05 11:38:56,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:56,633 INFO L276 IsEmpty]: Start isEmpty. Operand 53325 states and 65652 transitions. [2025-02-05 11:38:56,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2025-02-05 11:38:56,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:56,638 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:56,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:38:56,638 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:56,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:56,639 INFO L85 PathProgramCache]: Analyzing trace with hash -808792429, now seen corresponding path program 1 times [2025-02-05 11:38:56,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:56,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505967734] [2025-02-05 11:38:56,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:56,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:56,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 370 statements into 1 equivalence classes. [2025-02-05 11:38:56,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 370 of 370 statements. [2025-02-05 11:38:56,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:56,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:57,102 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 335 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-02-05 11:38:57,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:57,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505967734] [2025-02-05 11:38:57,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505967734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:57,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:57,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:38:57,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161297967] [2025-02-05 11:38:57,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:57,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:38:57,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:57,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:38:57,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:38:57,105 INFO L87 Difference]: Start difference. First operand 53325 states and 65652 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:59,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:59,855 INFO L93 Difference]: Finished difference Result 132182 states and 165315 transitions. [2025-02-05 11:38:59,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:38:59,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 370 [2025-02-05 11:38:59,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:59,945 INFO L225 Difference]: With dead ends: 132182 [2025-02-05 11:38:59,946 INFO L226 Difference]: Without dead ends: 79610 [2025-02-05 11:38:59,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:38:59,982 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 780 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2166 mSolverCounterSat, 912 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 3078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 912 IncrementalHoareTripleChecker+Valid, 2166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:59,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 105 Invalid, 3078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [912 Valid, 2166 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 11:39:00,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79610 states. [2025-02-05 11:39:00,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79610 to 79610. [2025-02-05 11:39:00,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79610 states, 79609 states have (on average 1.2368576417239256) internal successors, (98465), 79609 states have internal predecessors, (98465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:00,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79610 states to 79610 states and 98465 transitions. [2025-02-05 11:39:00,699 INFO L78 Accepts]: Start accepts. Automaton has 79610 states and 98465 transitions. Word has length 370 [2025-02-05 11:39:00,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:00,700 INFO L471 AbstractCegarLoop]: Abstraction has 79610 states and 98465 transitions. [2025-02-05 11:39:00,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:00,700 INFO L276 IsEmpty]: Start isEmpty. Operand 79610 states and 98465 transitions. [2025-02-05 11:39:00,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2025-02-05 11:39:00,703 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:00,704 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, 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, 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] [2025-02-05 11:39:00,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:39:00,704 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:00,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:00,704 INFO L85 PathProgramCache]: Analyzing trace with hash 632367576, now seen corresponding path program 1 times [2025-02-05 11:39:00,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:00,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409424218] [2025-02-05 11:39:00,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:00,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:00,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-02-05 11:39:00,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-02-05 11:39:00,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:00,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:00,835 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-05 11:39:00,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:00,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409424218] [2025-02-05 11:39:00,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409424218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:00,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:39:00,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:39:00,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752781972] [2025-02-05 11:39:00,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:00,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:39:00,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:00,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:39:00,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:39:00,836 INFO L87 Difference]: Start difference. First operand 79610 states and 98465 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:39:03,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:03,823 INFO L93 Difference]: Finished difference Result 180997 states and 223671 transitions. [2025-02-05 11:39:03,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:39:03,823 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 384 [2025-02-05 11:39:03,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:03,968 INFO L225 Difference]: With dead ends: 180997 [2025-02-05 11:39:03,968 INFO L226 Difference]: Without dead ends: 102140 [2025-02-05 11:39:03,999 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:39:04,000 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 761 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2068 mSolverCounterSat, 789 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 2857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 789 IncrementalHoareTripleChecker+Valid, 2068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:04,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 241 Invalid, 2857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [789 Valid, 2068 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 11:39:04,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102140 states. [2025-02-05 11:39:05,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102140 to 102140. [2025-02-05 11:39:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102140 states, 102139 states have (on average 1.2165969903758604) internal successors, (124262), 102139 states have internal predecessors, (124262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:05,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102140 states to 102140 states and 124262 transitions. [2025-02-05 11:39:05,219 INFO L78 Accepts]: Start accepts. Automaton has 102140 states and 124262 transitions. Word has length 384 [2025-02-05 11:39:05,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:05,219 INFO L471 AbstractCegarLoop]: Abstraction has 102140 states and 124262 transitions. [2025-02-05 11:39:05,219 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:39:05,219 INFO L276 IsEmpty]: Start isEmpty. Operand 102140 states and 124262 transitions. [2025-02-05 11:39:05,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-02-05 11:39:05,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:05,223 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:05,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:39:05,223 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:05,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:05,223 INFO L85 PathProgramCache]: Analyzing trace with hash -990693738, now seen corresponding path program 1 times [2025-02-05 11:39:05,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:05,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004424623] [2025-02-05 11:39:05,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:05,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:05,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-02-05 11:39:05,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-02-05 11:39:05,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:05,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:05,627 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 101 proven. 63 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-05 11:39:05,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:05,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004424623] [2025-02-05 11:39:05,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004424623] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:39:05,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753818392] [2025-02-05 11:39:05,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:05,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:39:05,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:39:05,630 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:39:05,634 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:39:05,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-02-05 11:39:05,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-02-05 11:39:05,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:05,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:05,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:39:05,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:39:05,821 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-05 11:39:05,821 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:39:05,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753818392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:05,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:39:05,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:39:05,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775573033] [2025-02-05 11:39:05,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:05,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:39:05,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:05,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:39:05,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:39:05,822 INFO L87 Difference]: Start difference. First operand 102140 states and 124262 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:08,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:08,549 INFO L93 Difference]: Finished difference Result 203527 states and 247766 transitions. [2025-02-05 11:39:08,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:39:08,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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 385 [2025-02-05 11:39:08,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:08,678 INFO L225 Difference]: With dead ends: 203527 [2025-02-05 11:39:08,679 INFO L226 Difference]: Without dead ends: 102140 [2025-02-05 11:39:08,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:39:08,738 INFO L435 NwaCegarLoop]: 1194 mSDtfsCounter, 727 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 2898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 496 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:08,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1202 Invalid, 2898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [496 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 11:39:08,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102140 states. [2025-02-05 11:39:09,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102140 to 101389. [2025-02-05 11:39:10,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101389 states, 101388 states have (on average 1.1903972856748333) internal successors, (120692), 101388 states have internal predecessors, (120692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:10,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101389 states to 101389 states and 120692 transitions. [2025-02-05 11:39:10,110 INFO L78 Accepts]: Start accepts. Automaton has 101389 states and 120692 transitions. Word has length 385 [2025-02-05 11:39:10,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:10,111 INFO L471 AbstractCegarLoop]: Abstraction has 101389 states and 120692 transitions. [2025-02-05 11:39:10,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:10,111 INFO L276 IsEmpty]: Start isEmpty. Operand 101389 states and 120692 transitions. [2025-02-05 11:39:10,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-02-05 11:39:10,121 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:10,122 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:39:10,128 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:39:10,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:39:10,326 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:10,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:10,326 INFO L85 PathProgramCache]: Analyzing trace with hash 895205130, now seen corresponding path program 1 times [2025-02-05 11:39:10,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:10,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259885893] [2025-02-05 11:39:10,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:10,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:10,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-02-05 11:39:10,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-02-05 11:39:10,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:10,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:10,533 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-05 11:39:10,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:10,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259885893] [2025-02-05 11:39:10,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259885893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:10,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:39:10,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:39:10,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982052176] [2025-02-05 11:39:10,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:10,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:39:10,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:10,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:39:10,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:39:10,535 INFO L87 Difference]: Start difference. First operand 101389 states and 120692 transitions. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:13,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:13,880 INFO L93 Difference]: Finished difference Result 252342 states and 301158 transitions. [2025-02-05 11:39:13,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:39:13,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 529 [2025-02-05 11:39:13,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:14,034 INFO L225 Difference]: With dead ends: 252342 [2025-02-05 11:39:14,034 INFO L226 Difference]: Without dead ends: 151706 [2025-02-05 11:39:14,087 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:39:14,088 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 551 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2267 mSolverCounterSat, 645 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 645 IncrementalHoareTripleChecker+Valid, 2267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:14,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 490 Invalid, 2912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [645 Valid, 2267 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 11:39:14,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151706 states. [2025-02-05 11:39:15,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151706 to 150955. [2025-02-05 11:39:15,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150955 states, 150954 states have (on average 1.1502908170701007) internal successors, (173641), 150954 states have internal predecessors, (173641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:15,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150955 states to 150955 states and 173641 transitions. [2025-02-05 11:39:15,746 INFO L78 Accepts]: Start accepts. Automaton has 150955 states and 173641 transitions. Word has length 529 [2025-02-05 11:39:15,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:15,747 INFO L471 AbstractCegarLoop]: Abstraction has 150955 states and 173641 transitions. [2025-02-05 11:39:15,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:15,747 INFO L276 IsEmpty]: Start isEmpty. Operand 150955 states and 173641 transitions. [2025-02-05 11:39:15,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2025-02-05 11:39:15,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:15,774 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:39:15,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:39:15,774 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:15,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:15,775 INFO L85 PathProgramCache]: Analyzing trace with hash 889007294, now seen corresponding path program 1 times [2025-02-05 11:39:15,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:15,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847465099] [2025-02-05 11:39:15,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:15,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:15,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 653 statements into 1 equivalence classes. [2025-02-05 11:39:15,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 653 of 653 statements. [2025-02-05 11:39:15,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:15,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:17,594 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 431 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:39:17,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:17,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847465099] [2025-02-05 11:39:17,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847465099] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:39:17,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70824389] [2025-02-05 11:39:17,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:17,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:39:17,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:39:17,603 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:39:17,605 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:39:17,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 653 statements into 1 equivalence classes. [2025-02-05 11:39:17,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 653 of 653 statements. [2025-02-05 11:39:17,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:17,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:17,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:39:17,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:39:18,455 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-02-05 11:39:18,456 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:39:18,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70824389] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:18,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:39:18,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-02-05 11:39:18,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305659048] [2025-02-05 11:39:18,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:18,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:39:18,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:18,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:39:18,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 11:39:18,459 INFO L87 Difference]: Start difference. First operand 150955 states and 173641 transitions. Second operand has 4 states, 4 states have (on average 98.5) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:23,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:23,816 INFO L93 Difference]: Finished difference Result 449857 states and 520159 transitions. [2025-02-05 11:39:23,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:39:23,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 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 653 [2025-02-05 11:39:23,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:24,243 INFO L225 Difference]: With dead ends: 449857 [2025-02-05 11:39:24,243 INFO L226 Difference]: Without dead ends: 299655 [2025-02-05 11:39:24,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 658 GetRequests, 652 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 11:39:24,389 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 1690 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 4558 mSolverCounterSat, 675 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1690 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 5233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 675 IncrementalHoareTripleChecker+Valid, 4558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:24,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1690 Valid, 87 Invalid, 5233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [675 Valid, 4558 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-02-05 11:39:24,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299655 states. [2025-02-05 11:39:27,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299655 to 299653. [2025-02-05 11:39:27,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299653 states, 299652 states have (on average 1.1512754795562854) internal successors, (344982), 299652 states have internal predecessors, (344982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299653 states to 299653 states and 344982 transitions. [2025-02-05 11:39:27,686 INFO L78 Accepts]: Start accepts. Automaton has 299653 states and 344982 transitions. Word has length 653 [2025-02-05 11:39:27,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:27,690 INFO L471 AbstractCegarLoop]: Abstraction has 299653 states and 344982 transitions. [2025-02-05 11:39:27,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:27,691 INFO L276 IsEmpty]: Start isEmpty. Operand 299653 states and 344982 transitions. [2025-02-05 11:39:27,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2025-02-05 11:39:27,741 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:27,741 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:39:27,748 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:39:27,942 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:39:27,942 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:27,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:27,943 INFO L85 PathProgramCache]: Analyzing trace with hash 321919462, now seen corresponding path program 1 times [2025-02-05 11:39:27,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:27,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293142195] [2025-02-05 11:39:27,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:27,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:27,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 696 statements into 1 equivalence classes. [2025-02-05 11:39:28,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 696 of 696 statements. [2025-02-05 11:39:28,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:28,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:29,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 743 proven. 308 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2025-02-05 11:39:29,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:29,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293142195] [2025-02-05 11:39:29,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293142195] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:39:29,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962986950] [2025-02-05 11:39:29,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:29,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:39:29,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:39:29,667 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:39:29,668 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:39:29,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 696 statements into 1 equivalence classes. [2025-02-05 11:39:30,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 696 of 696 statements. [2025-02-05 11:39:30,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:30,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:30,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:39:30,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:39:31,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 631 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2025-02-05 11:39:31,028 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:39:31,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962986950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:31,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:39:31,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 11:39:31,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729072985] [2025-02-05 11:39:31,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:31,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:39:31,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:31,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:39:31,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:39:31,033 INFO L87 Difference]: Start difference. First operand 299653 states and 344982 transitions. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:35,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:35,226 INFO L93 Difference]: Finished difference Result 564758 states and 654303 transitions. [2025-02-05 11:39:35,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:39:35,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 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 696 [2025-02-05 11:39:35,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:35,628 INFO L225 Difference]: With dead ends: 564758 [2025-02-05 11:39:35,628 INFO L226 Difference]: Without dead ends: 317677 [2025-02-05 11:39:35,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 695 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:39:35,741 INFO L435 NwaCegarLoop]: 1109 mSDtfsCounter, 645 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2176 mSolverCounterSat, 475 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 475 IncrementalHoareTripleChecker+Valid, 2176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:35,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 1117 Invalid, 2651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [475 Valid, 2176 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:39:35,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317677 states. [2025-02-05 11:39:38,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317677 to 277874. [2025-02-05 11:39:38,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277874 states, 277873 states have (on average 1.1506515566463815) internal successors, (319735), 277873 states have internal predecessors, (319735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:39,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277874 states to 277874 states and 319735 transitions. [2025-02-05 11:39:39,548 INFO L78 Accepts]: Start accepts. Automaton has 277874 states and 319735 transitions. Word has length 696 [2025-02-05 11:39:39,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:39,550 INFO L471 AbstractCegarLoop]: Abstraction has 277874 states and 319735 transitions. [2025-02-05 11:39:39,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:39,550 INFO L276 IsEmpty]: Start isEmpty. Operand 277874 states and 319735 transitions. [2025-02-05 11:39:39,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 867 [2025-02-05 11:39:39,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:39,617 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:39:39,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 11:39:39,817 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:39:39,818 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:39,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:39,818 INFO L85 PathProgramCache]: Analyzing trace with hash 350616570, now seen corresponding path program 1 times [2025-02-05 11:39:39,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:39,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158724855] [2025-02-05 11:39:39,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:39,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:40,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 866 statements into 1 equivalence classes. [2025-02-05 11:39:40,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 866 of 866 statements. [2025-02-05 11:39:40,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:40,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:40,484 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 550 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-05 11:39:40,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:40,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158724855] [2025-02-05 11:39:40,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158724855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:40,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:39:40,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:39:40,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932191477] [2025-02-05 11:39:40,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:40,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:39:40,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:40,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:39:40,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:39:40,487 INFO L87 Difference]: Start difference. First operand 277874 states and 319735 transitions. Second operand has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:44,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:44,270 INFO L93 Difference]: Finished difference Result 554995 states and 638712 transitions. [2025-02-05 11:39:44,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:39:44,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 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 866 [2025-02-05 11:39:44,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:44,912 INFO L225 Difference]: With dead ends: 554995 [2025-02-05 11:39:44,912 INFO L226 Difference]: Without dead ends: 277874 [2025-02-05 11:39:45,002 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:39:45,002 INFO L435 NwaCegarLoop]: 1277 mSDtfsCounter, 523 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2236 mSolverCounterSat, 440 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 2676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 440 IncrementalHoareTripleChecker+Valid, 2236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:45,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1285 Invalid, 2676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [440 Valid, 2236 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:39:45,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277874 states. [2025-02-05 11:39:47,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277874 to 274870. [2025-02-05 11:39:47,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274870 states, 274869 states have (on average 1.1194787335057792) internal successors, (307710), 274869 states have internal predecessors, (307710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:48,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274870 states to 274870 states and 307710 transitions. [2025-02-05 11:39:48,344 INFO L78 Accepts]: Start accepts. Automaton has 274870 states and 307710 transitions. Word has length 866 [2025-02-05 11:39:48,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:48,344 INFO L471 AbstractCegarLoop]: Abstraction has 274870 states and 307710 transitions. [2025-02-05 11:39:48,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:39:48,345 INFO L276 IsEmpty]: Start isEmpty. Operand 274870 states and 307710 transitions. [2025-02-05 11:39:48,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 882 [2025-02-05 11:39:48,388 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:48,389 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:39:48,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 11:39:48,389 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:48,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:48,390 INFO L85 PathProgramCache]: Analyzing trace with hash 728231139, now seen corresponding path program 1 times [2025-02-05 11:39:48,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:48,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401841230] [2025-02-05 11:39:48,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:48,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:48,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 881 statements into 1 equivalence classes. [2025-02-05 11:39:48,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 881 of 881 statements. [2025-02-05 11:39:48,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:48,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat