./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label30.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label30.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 80c5c0aba72ae94b1a7faaff5d18dcb1975bca24b2cca6ada65386f045cad987 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:32:36,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:32:36,078 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:32:36,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:32:36,083 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:32:36,099 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:32:36,100 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:32:36,100 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:32:36,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:32:36,100 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:32:36,100 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:32:36,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:32:36,101 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:32:36,101 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:32:36,101 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:32:36,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:32:36,101 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:32:36,101 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:32:36,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:32:36,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:32:36,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:32:36,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:32:36,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:32:36,101 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:32:36,101 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:32:36,101 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:32:36,101 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:32:36,102 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:32:36,102 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:32:36,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:32:36,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:32:36,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:32:36,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:32:36,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:32:36,102 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:32:36,102 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:32:36,102 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:32:36,102 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:32:36,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:32:36,102 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:32:36,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:32:36,102 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:32:36,102 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:32:36,102 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 -> 80c5c0aba72ae94b1a7faaff5d18dcb1975bca24b2cca6ada65386f045cad987 [2025-02-05 11:32:36,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:32:36,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:32:36,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:32:36,359 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:32:36,359 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:32:36,360 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label30.c [2025-02-05 11:32:37,596 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ddf5b84f/18ca4174bde74a8fa82138a6a2455026/FLAGec7a8ffa2 [2025-02-05 11:32:37,983 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:32:37,991 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label30.c [2025-02-05 11:32:38,008 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ddf5b84f/18ca4174bde74a8fa82138a6a2455026/FLAGec7a8ffa2 [2025-02-05 11:32:38,167 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ddf5b84f/18ca4174bde74a8fa82138a6a2455026 [2025-02-05 11:32:38,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:32:38,170 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:32:38,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:32:38,171 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:32:38,174 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:32:38,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:32:38" (1/1) ... [2025-02-05 11:32:38,175 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@be505d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:32:38, skipping insertion in model container [2025-02-05 11:32:38,175 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:32:38" (1/1) ... [2025-02-05 11:32:38,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:32:38,362 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/Problem11_label30.c[4279,4292] [2025-02-05 11:32:38,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:32:38,606 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:32:38,630 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/Problem11_label30.c[4279,4292] [2025-02-05 11:32:38,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:32:38,731 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:32:38,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:32:38 WrapperNode [2025-02-05 11:32:38,732 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:32:38,733 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:32:38,733 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:32:38,733 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:32:38,737 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:32:38" (1/1) ... [2025-02-05 11:32:38,757 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:32:38" (1/1) ... [2025-02-05 11:32:38,851 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-02-05 11:32:38,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:32:38,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:32:38,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:32:38,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:32:38,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:32:38" (1/1) ... [2025-02-05 11:32:38,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:32:38" (1/1) ... [2025-02-05 11:32:38,870 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:32:38" (1/1) ... [2025-02-05 11:32:38,952 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:32:38,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:32:38" (1/1) ... [2025-02-05 11:32:38,952 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:32:38" (1/1) ... [2025-02-05 11:32:38,990 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:32:38" (1/1) ... [2025-02-05 11:32:38,998 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:32:38" (1/1) ... [2025-02-05 11:32:39,007 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:32:38" (1/1) ... [2025-02-05 11:32:39,015 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:32:38" (1/1) ... [2025-02-05 11:32:39,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:32:39,029 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:32:39,029 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:32:39,029 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:32:39,030 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:32:38" (1/1) ... [2025-02-05 11:32:39,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:32:39,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:32:39,070 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:32:39,075 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:32:39,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:32:39,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:32:39,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:32:39,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:32:39,146 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:32:39,148 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:32:40,409 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-02-05 11:32:40,410 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:32:40,435 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:32:40,437 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:32:40,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:32:40 BoogieIcfgContainer [2025-02-05 11:32:40,438 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:32:40,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:32:40,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:32:40,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:32:40,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:32:38" (1/3) ... [2025-02-05 11:32:40,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3acd414e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:32:40, skipping insertion in model container [2025-02-05 11:32:40,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:32:38" (2/3) ... [2025-02-05 11:32:40,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3acd414e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:32:40, skipping insertion in model container [2025-02-05 11:32:40,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:32:40" (3/3) ... [2025-02-05 11:32:40,448 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label30.c [2025-02-05 11:32:40,461 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:32:40,463 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label30.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:32:40,522 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:32:40,534 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;@485c93c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:32:40,535 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:32:40,538 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:40,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 11:32:40,545 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:40,546 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] [2025-02-05 11:32:40,547 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:40,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:40,552 INFO L85 PathProgramCache]: Analyzing trace with hash -362269229, now seen corresponding path program 1 times [2025-02-05 11:32:40,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:40,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255700195] [2025-02-05 11:32:40,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:40,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:40,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 11:32:40,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 11:32:40,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:40,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:40,835 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:32:40,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:40,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255700195] [2025-02-05 11:32:40,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255700195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:40,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:40,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:32:40,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940794522] [2025-02-05 11:32:40,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:40,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:40,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:40,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:40,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:40,858 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 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 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:41,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:41,815 INFO L93 Difference]: Finished difference Result 761 states and 1342 transitions. [2025-02-05 11:32:41,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:41,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-02-05 11:32:41,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:41,824 INFO L225 Difference]: With dead ends: 761 [2025-02-05 11:32:41,825 INFO L226 Difference]: Without dead ends: 413 [2025-02-05 11:32:41,827 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:32:41,829 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 199 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:41,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 223 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:32:41,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-02-05 11:32:41,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2025-02-05 11:32:41,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:41,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2025-02-05 11:32:41,866 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 29 [2025-02-05 11:32:41,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:41,866 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2025-02-05 11:32:41,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:41,867 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2025-02-05 11:32:41,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 11:32:41,868 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:41,869 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:41,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:32:41,869 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:41,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:41,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1515858429, now seen corresponding path program 1 times [2025-02-05 11:32:41,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:41,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919582488] [2025-02-05 11:32:41,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:41,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:41,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 11:32:41,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 11:32:41,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:41,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:32:42,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:42,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919582488] [2025-02-05 11:32:42,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919582488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:42,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:42,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:32:42,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740167588] [2025-02-05 11:32:42,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:42,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:42,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:42,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:42,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:42,054 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:42,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:42,730 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2025-02-05 11:32:42,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:42,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-02-05 11:32:42,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:42,734 INFO L225 Difference]: With dead ends: 1211 [2025-02-05 11:32:42,734 INFO L226 Difference]: Without dead ends: 800 [2025-02-05 11:32:42,735 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:32:42,736 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:42,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 119 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:32:42,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-02-05 11:32:42,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2025-02-05 11:32:42,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3756345177664975) internal successors, (1084), 788 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:42,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1084 transitions. [2025-02-05 11:32:42,765 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1084 transitions. Word has length 97 [2025-02-05 11:32:42,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:42,765 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1084 transitions. [2025-02-05 11:32:42,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:42,765 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1084 transitions. [2025-02-05 11:32:42,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 11:32:42,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:42,771 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:42,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:32:42,771 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:42,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:42,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1160047449, now seen corresponding path program 1 times [2025-02-05 11:32:42,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:42,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276785025] [2025-02-05 11:32:42,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:42,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:42,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 11:32:42,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 11:32:42,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:42,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:43,313 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:32:43,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:43,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276785025] [2025-02-05 11:32:43,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276785025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:43,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:43,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:43,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604181520] [2025-02-05 11:32:43,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:43,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:32:43,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:43,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:32:43,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:32:43,317 INFO L87 Difference]: Start difference. First operand 789 states and 1084 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:44,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:44,422 INFO L93 Difference]: Finished difference Result 2505 states and 3428 transitions. [2025-02-05 11:32:44,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:32:44,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-02-05 11:32:44,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:44,433 INFO L225 Difference]: With dead ends: 2505 [2025-02-05 11:32:44,434 INFO L226 Difference]: Without dead ends: 1718 [2025-02-05 11:32:44,434 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:32:44,435 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 486 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:44,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 218 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 11:32:44,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2025-02-05 11:32:44,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1714. [2025-02-05 11:32:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1714 states, 1713 states have (on average 1.2265032107413893) internal successors, (2101), 1713 states have internal predecessors, (2101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:44,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2101 transitions. [2025-02-05 11:32:44,492 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2101 transitions. Word has length 98 [2025-02-05 11:32:44,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:44,492 INFO L471 AbstractCegarLoop]: Abstraction has 1714 states and 2101 transitions. [2025-02-05 11:32:44,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:44,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2101 transitions. [2025-02-05 11:32:44,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 11:32:44,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:44,497 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:44,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:32:44,497 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:44,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:44,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1295171761, now seen corresponding path program 1 times [2025-02-05 11:32:44,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:44,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092180080] [2025-02-05 11:32:44,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:44,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:44,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 11:32:44,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 11:32:44,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:44,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:44,827 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:32:44,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:44,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092180080] [2025-02-05 11:32:44,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092180080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:44,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:44,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:44,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103798695] [2025-02-05 11:32:44,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:44,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:32:44,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:44,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:32:44,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:32:44,832 INFO L87 Difference]: Start difference. First operand 1714 states and 2101 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:45,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:45,810 INFO L93 Difference]: Finished difference Result 5296 states and 6687 transitions. [2025-02-05 11:32:45,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:32:45,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2025-02-05 11:32:45,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:45,822 INFO L225 Difference]: With dead ends: 5296 [2025-02-05 11:32:45,822 INFO L226 Difference]: Without dead ends: 3768 [2025-02-05 11:32:45,824 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:32:45,825 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 365 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:45,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 87 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:32:45,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3768 states. [2025-02-05 11:32:45,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 3767. [2025-02-05 11:32:45,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3767 states, 3766 states have (on average 1.2291556027615507) internal successors, (4629), 3766 states have internal predecessors, (4629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:45,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3767 states to 3767 states and 4629 transitions. [2025-02-05 11:32:45,883 INFO L78 Accepts]: Start accepts. Automaton has 3767 states and 4629 transitions. Word has length 156 [2025-02-05 11:32:45,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:45,884 INFO L471 AbstractCegarLoop]: Abstraction has 3767 states and 4629 transitions. [2025-02-05 11:32:45,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:45,885 INFO L276 IsEmpty]: Start isEmpty. Operand 3767 states and 4629 transitions. [2025-02-05 11:32:45,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-02-05 11:32:45,888 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:45,889 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:45,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:32:45,889 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:45,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:45,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1452132319, now seen corresponding path program 1 times [2025-02-05 11:32:45,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:45,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107759803] [2025-02-05 11:32:45,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:45,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:45,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-05 11:32:45,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-05 11:32:45,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:45,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:46,125 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:32:46,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:46,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107759803] [2025-02-05 11:32:46,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107759803] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:46,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:46,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:46,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574569472] [2025-02-05 11:32:46,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:46,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:46,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:46,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:46,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:46,128 INFO L87 Difference]: Start difference. First operand 3767 states and 4629 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:46,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:46,731 INFO L93 Difference]: Finished difference Result 8652 states and 10854 transitions. [2025-02-05 11:32:46,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:46,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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 209 [2025-02-05 11:32:46,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:46,747 INFO L225 Difference]: With dead ends: 8652 [2025-02-05 11:32:46,747 INFO L226 Difference]: Without dead ends: 5256 [2025-02-05 11:32:46,751 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:32:46,753 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 136 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:46,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 346 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:32:46,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5256 states. [2025-02-05 11:32:46,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5256 to 5241. [2025-02-05 11:32:46,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5241 states, 5240 states have (on average 1.208206106870229) internal successors, (6331), 5240 states have internal predecessors, (6331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:46,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5241 states to 5241 states and 6331 transitions. [2025-02-05 11:32:46,829 INFO L78 Accepts]: Start accepts. Automaton has 5241 states and 6331 transitions. Word has length 209 [2025-02-05 11:32:46,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:46,830 INFO L471 AbstractCegarLoop]: Abstraction has 5241 states and 6331 transitions. [2025-02-05 11:32:46,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:46,830 INFO L276 IsEmpty]: Start isEmpty. Operand 5241 states and 6331 transitions. [2025-02-05 11:32:46,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-02-05 11:32:46,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:46,832 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:32:46,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:32:46,832 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:46,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:46,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1159410437, now seen corresponding path program 1 times [2025-02-05 11:32:46,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:46,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294093038] [2025-02-05 11:32:46,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:46,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:46,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-02-05 11:32:46,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-02-05 11:32:46,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:46,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:47,013 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-02-05 11:32:47,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:47,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294093038] [2025-02-05 11:32:47,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294093038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:47,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:47,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:47,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044085487] [2025-02-05 11:32:47,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:47,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:47,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:47,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:47,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:47,016 INFO L87 Difference]: Start difference. First operand 5241 states and 6331 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:47,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:47,559 INFO L93 Difference]: Finished difference Result 11049 states and 13480 transitions. [2025-02-05 11:32:47,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:47,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 210 [2025-02-05 11:32:47,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:47,576 INFO L225 Difference]: With dead ends: 11049 [2025-02-05 11:32:47,576 INFO L226 Difference]: Without dead ends: 6179 [2025-02-05 11:32:47,581 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:32:47,583 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 173 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:47,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 347 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:32:47,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6179 states. [2025-02-05 11:32:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6179 to 6161. [2025-02-05 11:32:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6161 states, 6160 states have (on average 1.2063311688311689) internal successors, (7431), 6160 states have internal predecessors, (7431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:47,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6161 states to 6161 states and 7431 transitions. [2025-02-05 11:32:47,699 INFO L78 Accepts]: Start accepts. Automaton has 6161 states and 7431 transitions. Word has length 210 [2025-02-05 11:32:47,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:47,699 INFO L471 AbstractCegarLoop]: Abstraction has 6161 states and 7431 transitions. [2025-02-05 11:32:47,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:47,699 INFO L276 IsEmpty]: Start isEmpty. Operand 6161 states and 7431 transitions. [2025-02-05 11:32:47,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-02-05 11:32:47,702 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:47,702 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:32:47,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:32:47,703 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:47,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:47,703 INFO L85 PathProgramCache]: Analyzing trace with hash 2027221700, now seen corresponding path program 1 times [2025-02-05 11:32:47,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:47,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055121245] [2025-02-05 11:32:47,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:47,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:47,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-02-05 11:32:47,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-02-05 11:32:47,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:47,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:47,869 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-02-05 11:32:47,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:47,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055121245] [2025-02-05 11:32:47,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055121245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:47,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:47,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:47,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973987478] [2025-02-05 11:32:47,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:47,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:47,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:47,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:47,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:47,871 INFO L87 Difference]: Start difference. First operand 6161 states and 7431 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:48,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:48,567 INFO L93 Difference]: Finished difference Result 13249 states and 16226 transitions. [2025-02-05 11:32:48,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:48,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 211 [2025-02-05 11:32:48,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:48,587 INFO L225 Difference]: With dead ends: 13249 [2025-02-05 11:32:48,587 INFO L226 Difference]: Without dead ends: 7459 [2025-02-05 11:32:48,595 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:32:48,595 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 168 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:48,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 371 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:32:48,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7459 states. [2025-02-05 11:32:48,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7459 to 7265. [2025-02-05 11:32:48,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7265 states, 7264 states have (on average 1.2014041850220265) internal successors, (8727), 7264 states have internal predecessors, (8727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:48,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7265 states to 7265 states and 8727 transitions. [2025-02-05 11:32:48,720 INFO L78 Accepts]: Start accepts. Automaton has 7265 states and 8727 transitions. Word has length 211 [2025-02-05 11:32:48,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:48,720 INFO L471 AbstractCegarLoop]: Abstraction has 7265 states and 8727 transitions. [2025-02-05 11:32:48,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:48,720 INFO L276 IsEmpty]: Start isEmpty. Operand 7265 states and 8727 transitions. [2025-02-05 11:32:48,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-02-05 11:32:48,723 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:48,723 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:32:48,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:32:48,723 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:48,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:48,725 INFO L85 PathProgramCache]: Analyzing trace with hash -368895050, now seen corresponding path program 1 times [2025-02-05 11:32:48,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:48,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591603452] [2025-02-05 11:32:48,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:48,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:48,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-02-05 11:32:48,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-02-05 11:32:48,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:48,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:49,011 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:32:49,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:49,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591603452] [2025-02-05 11:32:49,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591603452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:49,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:49,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:32:49,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508727757] [2025-02-05 11:32:49,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:49,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:32:49,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:49,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:32:49,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:32:49,013 INFO L87 Difference]: Start difference. First operand 7265 states and 8727 transitions. Second operand has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:50,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:50,204 INFO L93 Difference]: Finished difference Result 20643 states and 25402 transitions. [2025-02-05 11:32:50,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:32:50,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2025-02-05 11:32:50,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:50,242 INFO L225 Difference]: With dead ends: 20643 [2025-02-05 11:32:50,243 INFO L226 Difference]: Without dead ends: 13749 [2025-02-05 11:32:50,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:32:50,262 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 303 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:50,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 229 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 11:32:50,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13749 states. [2025-02-05 11:32:50,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13749 to 13745. [2025-02-05 11:32:50,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13745 states, 13744 states have (on average 1.1905558789289872) internal successors, (16363), 13744 states have internal predecessors, (16363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:50,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13745 states to 13745 states and 16363 transitions. [2025-02-05 11:32:50,610 INFO L78 Accepts]: Start accepts. Automaton has 13745 states and 16363 transitions. Word has length 231 [2025-02-05 11:32:50,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:50,610 INFO L471 AbstractCegarLoop]: Abstraction has 13745 states and 16363 transitions. [2025-02-05 11:32:50,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:50,611 INFO L276 IsEmpty]: Start isEmpty. Operand 13745 states and 16363 transitions. [2025-02-05 11:32:50,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-02-05 11:32:50,617 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:50,618 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:32:50,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:32:50,618 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:50,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:50,619 INFO L85 PathProgramCache]: Analyzing trace with hash 116105071, now seen corresponding path program 1 times [2025-02-05 11:32:50,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:50,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277739752] [2025-02-05 11:32:50,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:50,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:50,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-02-05 11:32:50,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-02-05 11:32:50,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:50,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:51,068 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:32:51,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:51,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277739752] [2025-02-05 11:32:51,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277739752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:51,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:51,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:32:51,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851798771] [2025-02-05 11:32:51,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:51,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:32:51,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:51,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:32:51,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:32:51,070 INFO L87 Difference]: Start difference. First operand 13745 states and 16363 transitions. Second operand has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:52,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:52,307 INFO L93 Difference]: Finished difference Result 32287 states and 39114 transitions. [2025-02-05 11:32:52,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:32:52,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 0 states have call successors, (0), 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 241 [2025-02-05 11:32:52,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:52,356 INFO L225 Difference]: With dead ends: 32287 [2025-02-05 11:32:52,356 INFO L226 Difference]: Without dead ends: 18913 [2025-02-05 11:32:52,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:32:52,371 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 316 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:52,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 131 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 11:32:52,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18913 states. [2025-02-05 11:32:52,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18913 to 18898. [2025-02-05 11:32:52,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18898 states, 18897 states have (on average 1.198179605228343) internal successors, (22642), 18897 states have internal predecessors, (22642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:52,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18898 states to 18898 states and 22642 transitions. [2025-02-05 11:32:52,622 INFO L78 Accepts]: Start accepts. Automaton has 18898 states and 22642 transitions. Word has length 241 [2025-02-05 11:32:52,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:52,622 INFO L471 AbstractCegarLoop]: Abstraction has 18898 states and 22642 transitions. [2025-02-05 11:32:52,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:52,622 INFO L276 IsEmpty]: Start isEmpty. Operand 18898 states and 22642 transitions. [2025-02-05 11:32:52,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-02-05 11:32:52,626 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:52,626 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:32:52,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:32:52,626 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:52,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:52,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1637469430, now seen corresponding path program 1 times [2025-02-05 11:32:52,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:52,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562678762] [2025-02-05 11:32:52,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:52,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:52,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-02-05 11:32:52,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-02-05 11:32:52,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:52,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:52,824 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-02-05 11:32:52,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:52,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562678762] [2025-02-05 11:32:52,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562678762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:52,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:52,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:52,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290234777] [2025-02-05 11:32:52,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:52,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:52,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:52,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:52,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:52,826 INFO L87 Difference]: Start difference. First operand 18898 states and 22642 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:53,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:53,492 INFO L93 Difference]: Finished difference Result 37622 states and 45117 transitions. [2025-02-05 11:32:53,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:53,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 248 [2025-02-05 11:32:53,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:53,520 INFO L225 Difference]: With dead ends: 37622 [2025-02-05 11:32:53,520 INFO L226 Difference]: Without dead ends: 18910 [2025-02-05 11:32:53,537 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:32:53,537 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 172 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:53,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 378 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:32:53,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18910 states. [2025-02-05 11:32:53,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18910 to 18713. [2025-02-05 11:32:53,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18713 states, 18712 states have (on average 1.1626763574177) internal successors, (21756), 18712 states have internal predecessors, (21756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:53,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18713 states to 18713 states and 21756 transitions. [2025-02-05 11:32:53,703 INFO L78 Accepts]: Start accepts. Automaton has 18713 states and 21756 transitions. Word has length 248 [2025-02-05 11:32:53,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:53,703 INFO L471 AbstractCegarLoop]: Abstraction has 18713 states and 21756 transitions. [2025-02-05 11:32:53,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:53,703 INFO L276 IsEmpty]: Start isEmpty. Operand 18713 states and 21756 transitions. [2025-02-05 11:32:53,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-02-05 11:32:53,707 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:53,707 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:32:53,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:32:53,707 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:53,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:53,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1943649273, now seen corresponding path program 1 times [2025-02-05 11:32:53,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:53,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319815166] [2025-02-05 11:32:53,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:53,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:53,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-05 11:32:53,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-05 11:32:53,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:53,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:32:54,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:54,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319815166] [2025-02-05 11:32:54,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319815166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:54,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:54,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:54,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214927234] [2025-02-05 11:32:54,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:54,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:32:54,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:54,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:32:54,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:32:54,005 INFO L87 Difference]: Start difference. First operand 18713 states and 21756 transitions. Second operand has 4 states, 4 states have (on average 65.5) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:55,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:55,046 INFO L93 Difference]: Finished difference Result 39443 states and 46209 transitions. [2025-02-05 11:32:55,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:32:55,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.5) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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 262 [2025-02-05 11:32:55,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:55,094 INFO L225 Difference]: With dead ends: 39443 [2025-02-05 11:32:55,097 INFO L226 Difference]: Without dead ends: 20548 [2025-02-05 11:32:55,115 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:32:55,119 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 194 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:55,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 179 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:32:55,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20548 states. [2025-02-05 11:32:55,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20548 to 18323. [2025-02-05 11:32:55,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18323 states, 18322 states have (on average 1.1256413055343304) internal successors, (20624), 18322 states have internal predecessors, (20624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:55,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18323 states to 18323 states and 20624 transitions. [2025-02-05 11:32:55,492 INFO L78 Accepts]: Start accepts. Automaton has 18323 states and 20624 transitions. Word has length 262 [2025-02-05 11:32:55,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:55,493 INFO L471 AbstractCegarLoop]: Abstraction has 18323 states and 20624 transitions. [2025-02-05 11:32:55,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.5) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:55,493 INFO L276 IsEmpty]: Start isEmpty. Operand 18323 states and 20624 transitions. [2025-02-05 11:32:55,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-02-05 11:32:55,506 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:55,507 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:55,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:32:55,507 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:55,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:55,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1968632706, now seen corresponding path program 1 times [2025-02-05 11:32:55,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:55,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980998921] [2025-02-05 11:32:55,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:55,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:55,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-02-05 11:32:55,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-02-05 11:32:55,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:55,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:55,746 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2025-02-05 11:32:55,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:55,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980998921] [2025-02-05 11:32:55,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980998921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:55,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:55,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:55,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269949704] [2025-02-05 11:32:55,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:55,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:55,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:55,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:55,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:55,751 INFO L87 Difference]: Start difference. First operand 18323 states and 20624 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:56,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:56,831 INFO L93 Difference]: Finished difference Result 38295 states and 43086 transitions. [2025-02-05 11:32:56,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:56,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 296 [2025-02-05 11:32:56,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:56,879 INFO L225 Difference]: With dead ends: 38295 [2025-02-05 11:32:56,879 INFO L226 Difference]: Without dead ends: 22370 [2025-02-05 11:32:56,907 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:32:56,911 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 193 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:56,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 148 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:32:56,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22370 states. [2025-02-05 11:32:57,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22370 to 14082. [2025-02-05 11:32:57,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14082 states, 14081 states have (on average 1.1337973155315673) internal successors, (15965), 14081 states have internal predecessors, (15965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14082 states to 14082 states and 15965 transitions. [2025-02-05 11:32:57,321 INFO L78 Accepts]: Start accepts. Automaton has 14082 states and 15965 transitions. Word has length 296 [2025-02-05 11:32:57,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:57,325 INFO L471 AbstractCegarLoop]: Abstraction has 14082 states and 15965 transitions. [2025-02-05 11:32:57,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:57,325 INFO L276 IsEmpty]: Start isEmpty. Operand 14082 states and 15965 transitions. [2025-02-05 11:32:57,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-02-05 11:32:57,338 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:57,339 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:32:57,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:32:57,339 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:57,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:57,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1156186785, now seen corresponding path program 1 times [2025-02-05 11:32:57,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:57,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318421791] [2025-02-05 11:32:57,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:57,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:57,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-02-05 11:32:57,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-02-05 11:32:57,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:57,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:58,150 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 56 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:32:58,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:58,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318421791] [2025-02-05 11:32:58,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318421791] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:32:58,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436418249] [2025-02-05 11:32:58,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:58,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:32:58,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:32:58,153 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:32:58,155 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:32:58,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-02-05 11:32:58,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-02-05 11:32:58,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:58,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:58,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:32:58,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:32:58,367 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-02-05 11:32:58,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:32:58,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436418249] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:58,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:32:58,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 11:32:58,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553416365] [2025-02-05 11:32:58,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:58,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:58,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:58,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:58,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:32:58,369 INFO L87 Difference]: Start difference. First operand 14082 states and 15965 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:59,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:59,136 INFO L93 Difference]: Finished difference Result 28898 states and 32763 transitions. [2025-02-05 11:32:59,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:59,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 309 [2025-02-05 11:32:59,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:59,169 INFO L225 Difference]: With dead ends: 28898 [2025-02-05 11:32:59,169 INFO L226 Difference]: Without dead ends: 14818 [2025-02-05 11:32:59,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 309 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:32:59,196 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 162 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:59,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 382 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:32:59,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14818 states. [2025-02-05 11:32:59,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14818 to 14450. [2025-02-05 11:32:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14450 states, 14449 states have (on average 1.1314969894110318) internal successors, (16349), 14449 states have internal predecessors, (16349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:59,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14450 states to 14450 states and 16349 transitions. [2025-02-05 11:32:59,461 INFO L78 Accepts]: Start accepts. Automaton has 14450 states and 16349 transitions. Word has length 309 [2025-02-05 11:32:59,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:59,462 INFO L471 AbstractCegarLoop]: Abstraction has 14450 states and 16349 transitions. [2025-02-05 11:32:59,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:59,462 INFO L276 IsEmpty]: Start isEmpty. Operand 14450 states and 16349 transitions. [2025-02-05 11:32:59,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-02-05 11:32:59,476 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:59,476 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:59,485 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:32:59,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 11:32:59,677 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:59,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:59,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1078475730, now seen corresponding path program 1 times [2025-02-05 11:32:59,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:59,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832353841] [2025-02-05 11:32:59,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:59,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:59,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-02-05 11:32:59,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-02-05 11:32:59,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:59,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:00,516 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 225 proven. 29 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-05 11:33:00,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:33:00,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832353841] [2025-02-05 11:33:00,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832353841] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:33:00,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695351609] [2025-02-05 11:33:00,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:00,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:33:00,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:33:00,523 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:33:00,524 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:33:00,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-02-05 11:33:00,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-02-05 11:33:00,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:00,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:00,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:33:00,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:33:01,057 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-05 11:33:01,058 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:33:01,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695351609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:33:01,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:33:01,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 11:33:01,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907929957] [2025-02-05 11:33:01,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:33:01,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:33:01,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:33:01,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:33:01,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 11:33:01,062 INFO L87 Difference]: Start difference. First operand 14450 states and 16349 transitions. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:01,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:33:01,879 INFO L93 Difference]: Finished difference Result 33878 states and 38197 transitions. [2025-02-05 11:33:01,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:33:01,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 316 [2025-02-05 11:33:01,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:33:01,899 INFO L225 Difference]: With dead ends: 33878 [2025-02-05 11:33:01,900 INFO L226 Difference]: Without dead ends: 19430 [2025-02-05 11:33:01,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 11:33:01,910 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 294 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:33:01,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 156 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:33:01,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19430 states. [2025-02-05 11:33:02,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19430 to 19426. [2025-02-05 11:33:02,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19426 states, 19425 states have (on average 1.1233976833976833) internal successors, (21822), 19425 states have internal predecessors, (21822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19426 states to 19426 states and 21822 transitions. [2025-02-05 11:33:02,067 INFO L78 Accepts]: Start accepts. Automaton has 19426 states and 21822 transitions. Word has length 316 [2025-02-05 11:33:02,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:33:02,067 INFO L471 AbstractCegarLoop]: Abstraction has 19426 states and 21822 transitions. [2025-02-05 11:33:02,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:02,067 INFO L276 IsEmpty]: Start isEmpty. Operand 19426 states and 21822 transitions. [2025-02-05 11:33:02,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-02-05 11:33:02,073 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:33:02,073 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:33:02,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 11:33:02,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:33:02,275 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:33:02,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:33:02,275 INFO L85 PathProgramCache]: Analyzing trace with hash 613154714, now seen corresponding path program 1 times [2025-02-05 11:33:02,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:33:02,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58912043] [2025-02-05 11:33:02,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:02,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:33:02,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-02-05 11:33:02,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-02-05 11:33:02,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:02,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:02,467 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-05 11:33:02,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:33:02,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58912043] [2025-02-05 11:33:02,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58912043] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:33:02,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:33:02,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:33:02,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340872487] [2025-02-05 11:33:02,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:33:02,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:33:02,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:33:02,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:33:02,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:33:02,468 INFO L87 Difference]: Start difference. First operand 19426 states and 21822 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:33:03,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:33:03,243 INFO L93 Difference]: Finished difference Result 39785 states and 44748 transitions. [2025-02-05 11:33:03,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:33:03,244 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 327 [2025-02-05 11:33:03,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:33:03,269 INFO L225 Difference]: With dead ends: 39785 [2025-02-05 11:33:03,269 INFO L226 Difference]: Without dead ends: 22757 [2025-02-05 11:33:03,274 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:33:03,275 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 196 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:33:03,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 145 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:33:03,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22757 states. [2025-02-05 11:33:03,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22757 to 19238. [2025-02-05 11:33:03,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19238 states, 19237 states have (on average 1.1226282684410251) internal successors, (21596), 19237 states have internal predecessors, (21596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:03,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19238 states to 19238 states and 21596 transitions. [2025-02-05 11:33:03,494 INFO L78 Accepts]: Start accepts. Automaton has 19238 states and 21596 transitions. Word has length 327 [2025-02-05 11:33:03,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:33:03,495 INFO L471 AbstractCegarLoop]: Abstraction has 19238 states and 21596 transitions. [2025-02-05 11:33:03,495 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:33:03,495 INFO L276 IsEmpty]: Start isEmpty. Operand 19238 states and 21596 transitions. [2025-02-05 11:33:03,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-02-05 11:33:03,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:33:03,503 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:33:03,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 11:33:03,503 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:33:03,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:33:03,503 INFO L85 PathProgramCache]: Analyzing trace with hash -966157961, now seen corresponding path program 1 times [2025-02-05 11:33:03,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:33:03,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329286015] [2025-02-05 11:33:03,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:03,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:33:03,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-02-05 11:33:03,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-02-05 11:33:03,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:03,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:03,933 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-02-05 11:33:03,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:33:03,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329286015] [2025-02-05 11:33:03,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329286015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:33:03,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:33:03,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 11:33:03,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159080826] [2025-02-05 11:33:03,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:33:03,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 11:33:03,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:33:03,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 11:33:03,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:33:03,934 INFO L87 Difference]: Start difference. First operand 19238 states and 21596 transitions. Second operand has 7 states, 7 states have (on average 35.42857142857143) internal successors, (248), 6 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:04,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:33:04,835 INFO L93 Difference]: Finished difference Result 36926 states and 41514 transitions. [2025-02-05 11:33:04,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 11:33:04,836 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.42857142857143) internal successors, (248), 6 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 333 [2025-02-05 11:33:04,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:33:04,854 INFO L225 Difference]: With dead ends: 36926 [2025-02-05 11:33:04,854 INFO L226 Difference]: Without dead ends: 17748 [2025-02-05 11:33:04,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:33:04,949 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 217 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:33:04,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 133 Invalid, 1692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:33:04,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17748 states. [2025-02-05 11:33:05,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17748 to 17736. [2025-02-05 11:33:05,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17736 states, 17735 states have (on average 1.1225260783760924) internal successors, (19908), 17735 states have internal predecessors, (19908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:05,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17736 states to 17736 states and 19908 transitions. [2025-02-05 11:33:05,060 INFO L78 Accepts]: Start accepts. Automaton has 17736 states and 19908 transitions. Word has length 333 [2025-02-05 11:33:05,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:33:05,061 INFO L471 AbstractCegarLoop]: Abstraction has 17736 states and 19908 transitions. [2025-02-05 11:33:05,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.42857142857143) internal successors, (248), 6 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:05,061 INFO L276 IsEmpty]: Start isEmpty. Operand 17736 states and 19908 transitions. [2025-02-05 11:33:05,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-02-05 11:33:05,067 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:33:05,067 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:33:05,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 11:33:05,067 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:33:05,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:33:05,068 INFO L85 PathProgramCache]: Analyzing trace with hash -2033279819, now seen corresponding path program 1 times [2025-02-05 11:33:05,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:33:05,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559821815] [2025-02-05 11:33:05,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:05,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:33:05,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-02-05 11:33:05,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-02-05 11:33:05,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:05,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:05,339 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-05 11:33:05,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:33:05,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559821815] [2025-02-05 11:33:05,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559821815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:33:05,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:33:05,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:33:05,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571913631] [2025-02-05 11:33:05,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:33:05,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:33:05,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:33:05,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:33:05,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:33:05,342 INFO L87 Difference]: Start difference. First operand 17736 states and 19908 transitions. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:06,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:33:06,448 INFO L93 Difference]: Finished difference Result 38607 states and 43438 transitions. [2025-02-05 11:33:06,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:33:06,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 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 338 [2025-02-05 11:33:06,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:33:06,471 INFO L225 Difference]: With dead ends: 38607 [2025-02-05 11:33:06,472 INFO L226 Difference]: Without dead ends: 21606 [2025-02-05 11:33:06,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:33:06,483 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 302 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:33:06,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 341 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 11:33:06,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21606 states. [2025-02-05 11:33:06,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21606 to 17725. [2025-02-05 11:33:06,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17725 states, 17724 states have (on average 1.0964793500338523) internal successors, (19434), 17724 states have internal predecessors, (19434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17725 states to 17725 states and 19434 transitions. [2025-02-05 11:33:06,637 INFO L78 Accepts]: Start accepts. Automaton has 17725 states and 19434 transitions. Word has length 338 [2025-02-05 11:33:06,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:33:06,638 INFO L471 AbstractCegarLoop]: Abstraction has 17725 states and 19434 transitions. [2025-02-05 11:33:06,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:06,638 INFO L276 IsEmpty]: Start isEmpty. Operand 17725 states and 19434 transitions. [2025-02-05 11:33:06,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-02-05 11:33:06,647 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:33:06,647 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:33:06,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 11:33:06,648 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:33:06,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:33:06,648 INFO L85 PathProgramCache]: Analyzing trace with hash 969621254, now seen corresponding path program 1 times [2025-02-05 11:33:06,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:33:06,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823606613] [2025-02-05 11:33:06,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:06,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:33:06,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-02-05 11:33:06,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-02-05 11:33:06,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:06,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:06,819 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 507 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-02-05 11:33:06,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:33:06,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823606613] [2025-02-05 11:33:06,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823606613] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:33:06,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:33:06,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:33:06,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949232896] [2025-02-05 11:33:06,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:33:06,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:33:06,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:33:06,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:33:06,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:33:06,822 INFO L87 Difference]: Start difference. First operand 17725 states and 19434 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:07,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:33:07,341 INFO L93 Difference]: Finished difference Result 37288 states and 40946 transitions. [2025-02-05 11:33:07,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:33:07,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 433 [2025-02-05 11:33:07,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:33:07,363 INFO L225 Difference]: With dead ends: 37288 [2025-02-05 11:33:07,364 INFO L226 Difference]: Without dead ends: 19933 [2025-02-05 11:33:07,377 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:33:07,377 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 107 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:33:07,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 351 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:33:07,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19933 states. [2025-02-05 11:33:07,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19933 to 18829. [2025-02-05 11:33:07,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18829 states, 18828 states have (on average 1.0929997875504567) internal successors, (20579), 18828 states have internal predecessors, (20579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:07,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18829 states to 18829 states and 20579 transitions. [2025-02-05 11:33:07,628 INFO L78 Accepts]: Start accepts. Automaton has 18829 states and 20579 transitions. Word has length 433 [2025-02-05 11:33:07,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:33:07,629 INFO L471 AbstractCegarLoop]: Abstraction has 18829 states and 20579 transitions. [2025-02-05 11:33:07,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:07,629 INFO L276 IsEmpty]: Start isEmpty. Operand 18829 states and 20579 transitions. [2025-02-05 11:33:07,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-02-05 11:33:07,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:33:07,637 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:33:07,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 11:33:07,638 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:33:07,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:33:07,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1525603539, now seen corresponding path program 1 times [2025-02-05 11:33:07,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:33:07,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042201227] [2025-02-05 11:33:07,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:07,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:33:07,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-02-05 11:33:07,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-02-05 11:33:07,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:07,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:08,448 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 154 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:33:08,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:33:08,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042201227] [2025-02-05 11:33:08,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042201227] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:33:08,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248812653] [2025-02-05 11:33:08,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:08,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:33:08,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:33:08,454 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:33:08,456 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:33:08,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-02-05 11:33:08,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-02-05 11:33:08,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:08,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:08,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 11:33:08,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:33:10,018 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 154 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:33:10,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:33:12,901 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 170 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:33:12,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248812653] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:33:12,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:33:12,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-05 11:33:12,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678257607] [2025-02-05 11:33:12,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:33:12,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 11:33:12,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:33:12,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 11:33:12,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-02-05 11:33:12,904 INFO L87 Difference]: Start difference. First operand 18829 states and 20579 transitions. Second operand has 13 states, 13 states have (on average 99.53846153846153) internal successors, (1294), 12 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:16,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:33:16,665 INFO L93 Difference]: Finished difference Result 41708 states and 45568 transitions. [2025-02-05 11:33:16,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 11:33:16,665 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 99.53846153846153) internal successors, (1294), 12 states have internal predecessors, (1294), 0 states have call successors, (0), 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 441 [2025-02-05 11:33:16,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:33:16,690 INFO L225 Difference]: With dead ends: 41708 [2025-02-05 11:33:16,690 INFO L226 Difference]: Without dead ends: 25275 [2025-02-05 11:33:16,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 892 GetRequests, 874 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=245, Unknown=0, NotChecked=0, Total=380 [2025-02-05 11:33:16,704 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 1383 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 6268 mSolverCounterSat, 492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1383 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 6760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 492 IncrementalHoareTripleChecker+Valid, 6268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:33:16,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1383 Valid, 212 Invalid, 6760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [492 Valid, 6268 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-02-05 11:33:16,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25275 states. [2025-02-05 11:33:16,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25275 to 20113. [2025-02-05 11:33:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20113 states, 20112 states have (on average 1.0893993635640413) internal successors, (21910), 20112 states have internal predecessors, (21910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:16,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20113 states to 20113 states and 21910 transitions. [2025-02-05 11:33:16,888 INFO L78 Accepts]: Start accepts. Automaton has 20113 states and 21910 transitions. Word has length 441 [2025-02-05 11:33:16,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:33:16,888 INFO L471 AbstractCegarLoop]: Abstraction has 20113 states and 21910 transitions. [2025-02-05 11:33:16,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 99.53846153846153) internal successors, (1294), 12 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:16,888 INFO L276 IsEmpty]: Start isEmpty. Operand 20113 states and 21910 transitions. [2025-02-05 11:33:16,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2025-02-05 11:33:16,905 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:33:16,905 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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:33:16,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 11:33:17,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:33:17,106 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:33:17,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:33:17,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1106472777, now seen corresponding path program 1 times [2025-02-05 11:33:17,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:33:17,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315191278] [2025-02-05 11:33:17,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:17,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:33:17,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-02-05 11:33:17,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-02-05 11:33:17,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:17,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:17,330 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2025-02-05 11:33:17,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:33:17,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315191278] [2025-02-05 11:33:17,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315191278] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:33:17,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:33:17,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:33:17,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914674385] [2025-02-05 11:33:17,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:33:17,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:33:17,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:33:17,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:33:17,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:33:17,332 INFO L87 Difference]: Start difference. First operand 20113 states and 21910 transitions. Second operand has 4 states, 4 states have (on average 94.5) 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:33:18,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:33:18,169 INFO L93 Difference]: Finished difference Result 39130 states and 42644 transitions. [2025-02-05 11:33:18,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:33:18,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 94.5) 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 531 [2025-02-05 11:33:18,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:33:18,190 INFO L225 Difference]: With dead ends: 39130 [2025-02-05 11:33:18,190 INFO L226 Difference]: Without dead ends: 21781 [2025-02-05 11:33:18,201 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:33:18,203 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 166 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:33:18,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 63 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:33:18,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21781 states. [2025-02-05 11:33:18,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21781 to 19929. [2025-02-05 11:33:18,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19929 states, 19928 states have (on average 1.0882677639502207) internal successors, (21687), 19928 states have internal predecessors, (21687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:18,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19929 states to 19929 states and 21687 transitions. [2025-02-05 11:33:18,373 INFO L78 Accepts]: Start accepts. Automaton has 19929 states and 21687 transitions. Word has length 531 [2025-02-05 11:33:18,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:33:18,374 INFO L471 AbstractCegarLoop]: Abstraction has 19929 states and 21687 transitions. [2025-02-05 11:33:18,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.5) 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:33:18,374 INFO L276 IsEmpty]: Start isEmpty. Operand 19929 states and 21687 transitions. [2025-02-05 11:33:18,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-02-05 11:33:18,386 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:33:18,386 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-02-05 11:33:18,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 11:33:18,386 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:33:18,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:33:18,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1102497269, now seen corresponding path program 1 times [2025-02-05 11:33:18,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:33:18,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466137053] [2025-02-05 11:33:18,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:18,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:33:18,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-02-05 11:33:18,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-02-05 11:33:18,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:18,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:18,679 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2025-02-05 11:33:18,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:33:18,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466137053] [2025-02-05 11:33:18,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466137053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:33:18,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:33:18,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:33:18,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246674983] [2025-02-05 11:33:18,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:33:18,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:33:18,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:33:18,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:33:18,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:33:18,683 INFO L87 Difference]: Start difference. First operand 19929 states and 21687 transitions. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:19,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:33:19,246 INFO L93 Difference]: Finished difference Result 37845 states and 41169 transitions. [2025-02-05 11:33:19,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:33:19,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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 545 [2025-02-05 11:33:19,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:33:19,267 INFO L225 Difference]: With dead ends: 37845 [2025-02-05 11:33:19,267 INFO L226 Difference]: Without dead ends: 20496 [2025-02-05 11:33:19,282 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:33:19,283 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 105 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:33:19,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 150 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:33:19,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20496 states. [2025-02-05 11:33:19,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20496 to 12931. [2025-02-05 11:33:19,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12931 states, 12930 states have (on average 1.0876256767208043) internal successors, (14063), 12930 states have internal predecessors, (14063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12931 states to 12931 states and 14063 transitions. [2025-02-05 11:33:19,425 INFO L78 Accepts]: Start accepts. Automaton has 12931 states and 14063 transitions. Word has length 545 [2025-02-05 11:33:19,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:33:19,426 INFO L471 AbstractCegarLoop]: Abstraction has 12931 states and 14063 transitions. [2025-02-05 11:33:19,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:19,426 INFO L276 IsEmpty]: Start isEmpty. Operand 12931 states and 14063 transitions. [2025-02-05 11:33:19,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2025-02-05 11:33:19,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:33:19,436 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-02-05 11:33:19,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 11:33:19,437 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:33:19,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:33:19,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1589998242, now seen corresponding path program 1 times [2025-02-05 11:33:19,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:33:19,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086067173] [2025-02-05 11:33:19,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:19,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:33:19,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-02-05 11:33:19,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-02-05 11:33:19,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:19,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:19,678 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2025-02-05 11:33:19,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:33:19,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086067173] [2025-02-05 11:33:19,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086067173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:33:19,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:33:19,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:33:19,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124508086] [2025-02-05 11:33:19,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:33:19,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:33:19,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:33:19,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:33:19,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:33:19,679 INFO L87 Difference]: Start difference. First operand 12931 states and 14063 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:20,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:33:20,200 INFO L93 Difference]: Finished difference Result 27148 states and 29461 transitions. [2025-02-05 11:33:20,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:33:20,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 546 [2025-02-05 11:33:20,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:33:20,217 INFO L225 Difference]: With dead ends: 27148 [2025-02-05 11:33:20,217 INFO L226 Difference]: Without dead ends: 14035 [2025-02-05 11:33:20,224 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:33:20,229 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 100 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:33:20,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 129 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:33:20,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14035 states. [2025-02-05 11:33:20,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14035 to 11821. [2025-02-05 11:33:20,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11821 states, 11820 states have (on average 1.0866328257191202) internal successors, (12844), 11820 states have internal predecessors, (12844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:20,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11821 states to 11821 states and 12844 transitions. [2025-02-05 11:33:20,354 INFO L78 Accepts]: Start accepts. Automaton has 11821 states and 12844 transitions. Word has length 546 [2025-02-05 11:33:20,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:33:20,355 INFO L471 AbstractCegarLoop]: Abstraction has 11821 states and 12844 transitions. [2025-02-05 11:33:20,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:20,355 INFO L276 IsEmpty]: Start isEmpty. Operand 11821 states and 12844 transitions. [2025-02-05 11:33:20,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2025-02-05 11:33:20,363 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:33:20,363 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:33:20,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 11:33:20,364 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:33:20,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:33:20,364 INFO L85 PathProgramCache]: Analyzing trace with hash 640882642, now seen corresponding path program 1 times [2025-02-05 11:33:20,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:33:20,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253063272] [2025-02-05 11:33:20,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:20,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:33:20,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-02-05 11:33:20,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-02-05 11:33:20,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:20,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:20,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 675 proven. 0 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2025-02-05 11:33:20,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:33:20,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253063272] [2025-02-05 11:33:20,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253063272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:33:20,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:33:20,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:33:20,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322281730] [2025-02-05 11:33:20,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:33:20,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:33:20,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:33:20,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:33:20,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:33:20,629 INFO L87 Difference]: Start difference. First operand 11821 states and 12844 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:21,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:33:21,156 INFO L93 Difference]: Finished difference Result 22899 states and 24838 transitions. [2025-02-05 11:33:21,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:33:21,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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 596 [2025-02-05 11:33:21,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:33:21,167 INFO L225 Difference]: With dead ends: 22899 [2025-02-05 11:33:21,167 INFO L226 Difference]: Without dead ends: 11080 [2025-02-05 11:33:21,174 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:33:21,175 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 190 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:33:21,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 316 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:33:21,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11080 states. [2025-02-05 11:33:21,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11080 to 11080. [2025-02-05 11:33:21,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11080 states, 11079 states have (on average 1.0778951168878057) internal successors, (11942), 11079 states have internal predecessors, (11942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:21,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11080 states to 11080 states and 11942 transitions. [2025-02-05 11:33:21,257 INFO L78 Accepts]: Start accepts. Automaton has 11080 states and 11942 transitions. Word has length 596 [2025-02-05 11:33:21,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:33:21,258 INFO L471 AbstractCegarLoop]: Abstraction has 11080 states and 11942 transitions. [2025-02-05 11:33:21,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:21,258 INFO L276 IsEmpty]: Start isEmpty. Operand 11080 states and 11942 transitions. [2025-02-05 11:33:21,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2025-02-05 11:33:21,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:33:21,277 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:33:21,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 11:33:21,282 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:33:21,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:33:21,282 INFO L85 PathProgramCache]: Analyzing trace with hash 500796150, now seen corresponding path program 1 times [2025-02-05 11:33:21,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:33:21,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957210301] [2025-02-05 11:33:21,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:33:21,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:33:21,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 679 statements into 1 equivalence classes. [2025-02-05 11:33:21,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 679 of 679 statements. [2025-02-05 11:33:21,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:33:21,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:33:21,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 979 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2025-02-05 11:33:21,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:33:21,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957210301] [2025-02-05 11:33:21,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957210301] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:33:21,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:33:21,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:33:21,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276649183] [2025-02-05 11:33:21,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:33:21,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:33:21,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:33:21,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:33:21,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:33:21,531 INFO L87 Difference]: Start difference. First operand 11080 states and 11942 transitions. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:22,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:33:22,051 INFO L93 Difference]: Finished difference Result 22155 states and 23845 transitions. [2025-02-05 11:33:22,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:33:22,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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 679 [2025-02-05 11:33:22,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:33:22,053 INFO L225 Difference]: With dead ends: 22155 [2025-02-05 11:33:22,054 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 11:33:22,068 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:33:22,071 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 52 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:33:22,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 306 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:33:22,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 11:33:22,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 11:33:22,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:22,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 11:33:22,073 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 679 [2025-02-05 11:33:22,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:33:22,073 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 11:33:22,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:33:22,073 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 11:33:22,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 11:33:22,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 11:33:22,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 11:33:22,084 INFO L422 BasicCegarLoop]: Path program 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] [2025-02-05 11:33:22,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 11:33:28,787 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 11:33:28,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:33:28 BoogieIcfgContainer [2025-02-05 11:33:28,801 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 11:33:28,802 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 11:33:28,802 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 11:33:28,802 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 11:33:28,802 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:32:40" (3/4) ... [2025-02-05 11:33:28,804 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 11:33:28,831 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-05 11:33:28,832 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 11:33:28,832 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 11:33:28,833 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 11:33:29,087 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 11:33:29,088 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 11:33:29,088 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 11:33:29,088 INFO L158 Benchmark]: Toolchain (without parser) took 50918.52ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 106.3MB in the beginning and 264.1MB in the end (delta: -157.8MB). Peak memory consumption was 661.0MB. Max. memory is 16.1GB. [2025-02-05 11:33:29,089 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 100.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 11:33:29,091 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.50ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 63.3MB in the end (delta: 42.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-05 11:33:29,091 INFO L158 Benchmark]: Boogie Procedure Inliner took 119.11ms. Allocated memory is still 142.6MB. Free memory was 63.3MB in the beginning and 46.2MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 11:33:29,092 INFO L158 Benchmark]: Boogie Preprocessor took 174.81ms. Allocated memory is still 142.6MB. Free memory was 46.2MB in the beginning and 84.5MB in the end (delta: -38.2MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2025-02-05 11:33:29,092 INFO L158 Benchmark]: IcfgBuilder took 1409.91ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 97.9MB in the end (delta: -13.5MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. [2025-02-05 11:33:29,092 INFO L158 Benchmark]: TraceAbstraction took 48361.08ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 96.9MB in the beginning and 911.1MB in the end (delta: -814.2MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-02-05 11:33:29,092 INFO L158 Benchmark]: Witness Printer took 286.21ms. Allocated memory was 1.6GB in the beginning and 394.3MB in the end (delta: -1.2GB). Free memory was 911.1MB in the beginning and 264.1MB in the end (delta: 647.0MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2025-02-05 11:33:29,094 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 100.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 561.50ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 63.3MB in the end (delta: 42.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 119.11ms. Allocated memory is still 142.6MB. Free memory was 63.3MB in the beginning and 46.2MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 174.81ms. Allocated memory is still 142.6MB. Free memory was 46.2MB in the beginning and 84.5MB in the end (delta: -38.2MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1409.91ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 97.9MB in the end (delta: -13.5MB). Peak memory consumption was 60.7MB. Max. memory is 16.1GB. * TraceAbstraction took 48361.08ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 96.9MB in the beginning and 911.1MB in the end (delta: -814.2MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 286.21ms. Allocated memory was 1.6GB in the beginning and 394.3MB in the end (delta: -1.2GB). Free memory was 911.1MB in the beginning and 264.1MB in the end (delta: 647.0MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 103]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.6s, OverallIterations: 24, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 23.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6123 SdHoareTripleChecker+Valid, 20.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6123 mSDsluCounter, 5460 SdHoareTripleChecker+Invalid, 16.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 915 mSDsCounter, 2603 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24108 IncrementalHoareTripleChecker+Invalid, 26711 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2603 mSolverCounterUnsat, 4545 mSDtfsCounter, 24108 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1593 GetRequests, 1532 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20113occurred in iteration=19, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 24 MinimizatonAttempts, 36653 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 8748 NumberOfCodeBlocks, 8748 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 9161 ConstructedInterpolants, 0 QuantifiedInterpolants, 37968 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1442 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 28 InterpolantComputations, 23 PerfectInterpolantSequences, 9583/10506 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((a23 <= 262) && (a3 == 1)) && (a29 <= 220)) && (a4 == 1)) && (a8 == 15)) || (((((((long long) a23 + 43) <= 0) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a25 == 10))) || (((((a25 == 12) && (a3 == 1)) && ((((a25 != 13) || (a23 < 307)) && ((a23 < 307) || (a25 != 12))) || (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 138080))) && (a4 == 1)) && (a8 == 15))) || (((((((long long) a23 + 43) <= 0) && (a29 <= 140)) && (a25 == 11)) && (a3 == 1)) && (a8 == 15))) || ((((((long long) a29 + 275802) <= 0) && (a25 == 9)) && (a4 == 1)) && (a23 <= 312))) || ((((a25 == 11) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a29 <= 140) && (a25 == 9)) && (a3 == 1)) && (a23 <= 138)) && (a8 == 15))) || ((((((long long) a23 + 43) <= 0) && (a25 == 9)) && (a3 == 1)) && (a8 == 15))) || ((((((long long) a23 + 127601) <= 0) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a3 == 1) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42))) && (13 <= a25))) || (((((((570382 <= a29) && (a25 <= 10)) && (a3 == 1)) && (a4 == 1)) && (312 <= a23)) && (a8 == 15)) && ((a23 < 307) || (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 483751)))) || ((((((long long) a23 + 127601) <= 0) && (a25 == 11)) && (a3 == 1)) && (a8 == 15))) || ((((a25 == 9) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a29 <= 245) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a25 == 10))) || ((((a3 == 1) && (a8 == 15)) && (a25 == 10)) && (a29 <= 130))) || ((((((a29 <= 140) && (a3 == 1)) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42))) && (a25 == 10))) || (((((a25 == 12) && (a3 == 1)) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || (((a25 == 9) && (((long long) a23 + 599772) <= 0)) && (a4 == 1))) || (((((307 <= a23) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a25 == 10))) || ((((a29 <= 275) && (a25 == 12)) && (a3 == 1)) && (a8 == 15))) || ((((((a3 == 1) && ((((a25 != 13) || (a23 < 307)) && ((a23 < 307) || (a25 != 12))) || (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 138080))) && (a4 == 1)) && (a8 == 15)) && ((a23 < 307) || (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 483751))) && (13 <= a25))) || (((((a25 <= 10) && (a3 == 1)) && (((long long) a23 + 599772) <= 0)) && (a8 == 15)) && (a29 <= 130))) || ((((a25 == 12) && (((long long) a23 + 127601) <= 0)) && (a3 == 1)) && (a8 == 15))) RESULT: Ultimate proved your program to be correct! [2025-02-05 11:33:29,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE