./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label32.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/Problem17_label32.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 758b6bdd5f0153469513ef6931f2486fab3d5fd3aa9f01cac0e5fdb67f3e5b48 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:04:03,123 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:04:03,160 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 12:04:03,164 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:04:03,164 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:04:03,179 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:04:03,179 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:04:03,179 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:04:03,180 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:04:03,180 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:04:03,180 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:04:03,180 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:04:03,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:04:03,180 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:04:03,180 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:04:03,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:04:03,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:04:03,180 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:04:03,181 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:04:03,181 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:04:03,181 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:04:03,181 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:04:03,181 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:04:03,181 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:04:03,181 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:04:03,181 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:04:03,181 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:04:03,181 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:04:03,181 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:04:03,181 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:04:03,181 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:04:03,181 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:04:03,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:04:03,181 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:04:03,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:04:03,181 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:04:03,182 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:04:03,182 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:04:03,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:04:03,182 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:04:03,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:04:03,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:04:03,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:04:03,182 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 -> 758b6bdd5f0153469513ef6931f2486fab3d5fd3aa9f01cac0e5fdb67f3e5b48 [2025-02-05 12:04:03,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:04:03,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:04:03,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:04:03,401 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:04:03,402 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:04:03,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label32.c [2025-02-05 12:04:04,800 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2db875c9/715e83c3472a46aba89b3dc4eae7ab6d/FLAG3bbdceb3a [2025-02-05 12:04:05,398 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:04:05,399 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label32.c [2025-02-05 12:04:05,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2db875c9/715e83c3472a46aba89b3dc4eae7ab6d/FLAG3bbdceb3a [2025-02-05 12:04:05,900 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e2db875c9/715e83c3472a46aba89b3dc4eae7ab6d [2025-02-05 12:04:05,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:04:05,906 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:04:05,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:04:05,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:04:05,911 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:04:05,912 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:04:05" (1/1) ... [2025-02-05 12:04:05,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4187e455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:05, skipping insertion in model container [2025-02-05 12:04:05,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:04:05" (1/1) ... [2025-02-05 12:04:05,972 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:04:06,204 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/Problem17_label32.c[7145,7158] [2025-02-05 12:04:06,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:04:06,681 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:04:06,705 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/Problem17_label32.c[7145,7158] [2025-02-05 12:04:06,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:04:06,955 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:04:06,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:06 WrapperNode [2025-02-05 12:04:06,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:04:06,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:04:06,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:04:06,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:04:06,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:06" (1/1) ... [2025-02-05 12:04:07,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:06" (1/1) ... [2025-02-05 12:04:07,201 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-02-05 12:04:07,201 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:04:07,202 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:04:07,202 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:04:07,202 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:04:07,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:06" (1/1) ... [2025-02-05 12:04:07,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:06" (1/1) ... [2025-02-05 12:04:07,247 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:06" (1/1) ... [2025-02-05 12:04:07,426 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 12:04:07,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:06" (1/1) ... [2025-02-05 12:04:07,427 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:06" (1/1) ... [2025-02-05 12:04:07,556 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:06" (1/1) ... [2025-02-05 12:04:07,587 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:06" (1/1) ... [2025-02-05 12:04:07,621 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:06" (1/1) ... [2025-02-05 12:04:07,651 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:06" (1/1) ... [2025-02-05 12:04:07,724 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:04:07,726 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:04:07,726 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:04:07,727 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:04:07,728 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:06" (1/1) ... [2025-02-05 12:04:07,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:04:07,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:04:07,770 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 12:04:07,780 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 12:04:07,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:04:07,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 12:04:07,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:04:07,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:04:07,848 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:04:07,849 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:04:10,654 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-02-05 12:04:10,755 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-02-05 12:04:10,755 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:04:10,783 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:04:10,785 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:04:10,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:04:10 BoogieIcfgContainer [2025-02-05 12:04:10,787 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:04:10,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:04:10,790 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:04:10,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:04:10,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:04:05" (1/3) ... [2025-02-05 12:04:10,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738aea39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:04:10, skipping insertion in model container [2025-02-05 12:04:10,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:04:06" (2/3) ... [2025-02-05 12:04:10,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738aea39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:04:10, skipping insertion in model container [2025-02-05 12:04:10,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:04:10" (3/3) ... [2025-02-05 12:04:10,796 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label32.c [2025-02-05 12:04:10,809 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:04:10,810 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label32.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 12:04:10,872 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:04:10,882 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;@450c5b01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:04:10,883 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:04:10,888 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 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 12:04:10,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 12:04:10,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:10,896 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:04:10,897 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:10,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:10,902 INFO L85 PathProgramCache]: Analyzing trace with hash -69342529, now seen corresponding path program 1 times [2025-02-05 12:04:10,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:10,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511069561] [2025-02-05 12:04:10,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:10,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:10,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 12:04:11,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 12:04:11,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:11,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:11,192 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 12:04:11,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:11,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511069561] [2025-02-05 12:04:11,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511069561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:11,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:11,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:04:11,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190344838] [2025-02-05 12:04:11,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:11,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:11,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:11,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:11,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:11,219 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 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 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 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 12:04:13,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:13,192 INFO L93 Difference]: Finished difference Result 1644 states and 3026 transitions. [2025-02-05 12:04:13,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:13,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-02-05 12:04:13,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:13,205 INFO L225 Difference]: With dead ends: 1644 [2025-02-05 12:04:13,205 INFO L226 Difference]: Without dead ends: 977 [2025-02-05 12:04:13,209 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 12:04:13,211 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 440 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:13,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 12:04:13,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-02-05 12:04:13,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2025-02-05 12:04:13,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 0 states have call successors, (0), 0 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 12:04:13,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2025-02-05 12:04:13,288 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 48 [2025-02-05 12:04:13,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:13,289 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2025-02-05 12:04:13,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 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 12:04:13,289 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2025-02-05 12:04:13,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 12:04:13,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:13,330 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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 12:04:13,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 12:04:13,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:13,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:13,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1000132033, now seen corresponding path program 1 times [2025-02-05 12:04:13,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:13,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554958380] [2025-02-05 12:04:13,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:13,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:13,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 12:04:13,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 12:04:13,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:13,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:04:13,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:13,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554958380] [2025-02-05 12:04:13,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554958380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:13,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:13,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:04:13,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926902329] [2025-02-05 12:04:13,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:13,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:13,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:13,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:13,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:13,739 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 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 12:04:16,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:16,096 INFO L93 Difference]: Finished difference Result 2813 states and 4381 transitions. [2025-02-05 12:04:16,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:16,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-02-05 12:04:16,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:16,102 INFO L225 Difference]: With dead ends: 2813 [2025-02-05 12:04:16,103 INFO L226 Difference]: Without dead ends: 1844 [2025-02-05 12:04:16,104 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 12:04:16,105 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:16,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 580 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 12:04:16,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-02-05 12:04:16,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1841. [2025-02-05 12:04:16,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.35) internal successors, (2484), 1840 states have internal predecessors, (2484), 0 states have call successors, (0), 0 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 12:04:16,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2484 transitions. [2025-02-05 12:04:16,151 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2484 transitions. Word has length 115 [2025-02-05 12:04:16,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:16,153 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2484 transitions. [2025-02-05 12:04:16,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 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 12:04:16,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2484 transitions. [2025-02-05 12:04:16,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 12:04:16,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:16,156 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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 12:04:16,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 12:04:16,157 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:16,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:16,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2125598745, now seen corresponding path program 1 times [2025-02-05 12:04:16,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:16,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199400400] [2025-02-05 12:04:16,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:16,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:16,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 12:04:16,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 12:04:16,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:16,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:16,490 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:04:16,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:16,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199400400] [2025-02-05 12:04:16,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199400400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:16,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:16,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:16,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996033104] [2025-02-05 12:04:16,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:16,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:04:16,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:16,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:04:16,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:04:16,492 INFO L87 Difference]: Start difference. First operand 1841 states and 2484 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:04:19,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:19,428 INFO L93 Difference]: Finished difference Result 6767 states and 9259 transitions. [2025-02-05 12:04:19,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:04:19,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2025-02-05 12:04:19,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:19,462 INFO L225 Difference]: With dead ends: 6767 [2025-02-05 12:04:19,462 INFO L226 Difference]: Without dead ends: 4928 [2025-02-05 12:04:19,467 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 12:04:19,467 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 866 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2790 mSolverCounterSat, 593 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 3383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 593 IncrementalHoareTripleChecker+Valid, 2790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:19,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 327 Invalid, 3383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [593 Valid, 2790 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 12:04:19,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4928 states. [2025-02-05 12:04:19,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4928 to 4875. [2025-02-05 12:04:19,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4875 states, 4874 states have (on average 1.2866228970045137) internal successors, (6271), 4874 states have internal predecessors, (6271), 0 states have call successors, (0), 0 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 12:04:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4875 states to 4875 states and 6271 transitions. [2025-02-05 12:04:19,632 INFO L78 Accepts]: Start accepts. Automaton has 4875 states and 6271 transitions. Word has length 118 [2025-02-05 12:04:19,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:19,633 INFO L471 AbstractCegarLoop]: Abstraction has 4875 states and 6271 transitions. [2025-02-05 12:04:19,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:04:19,633 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 6271 transitions. [2025-02-05 12:04:19,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-05 12:04:19,634 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:19,635 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 12:04:19,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 12:04:19,635 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:19,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:19,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1283081396, now seen corresponding path program 1 times [2025-02-05 12:04:19,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:19,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113130682] [2025-02-05 12:04:19,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:19,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:19,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-05 12:04:19,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-05 12:04:19,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:19,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-02-05 12:04:19,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:19,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113130682] [2025-02-05 12:04:19,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113130682] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:19,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:19,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:04:19,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888429264] [2025-02-05 12:04:19,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:19,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:19,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:19,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:19,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:19,973 INFO L87 Difference]: Start difference. First operand 4875 states and 6271 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:04:21,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:21,608 INFO L93 Difference]: Finished difference Result 14436 states and 18544 transitions. [2025-02-05 12:04:21,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:21,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 187 [2025-02-05 12:04:21,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:21,629 INFO L225 Difference]: With dead ends: 14436 [2025-02-05 12:04:21,630 INFO L226 Difference]: Without dead ends: 8277 [2025-02-05 12:04:21,635 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 12:04:21,636 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:21,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:04:21,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8277 states. [2025-02-05 12:04:21,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8277 to 6576. [2025-02-05 12:04:21,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6576 states, 6575 states have (on average 1.1793155893536122) internal successors, (7754), 6575 states have internal predecessors, (7754), 0 states have call successors, (0), 0 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 12:04:21,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6576 states to 6576 states and 7754 transitions. [2025-02-05 12:04:21,720 INFO L78 Accepts]: Start accepts. Automaton has 6576 states and 7754 transitions. Word has length 187 [2025-02-05 12:04:21,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:21,720 INFO L471 AbstractCegarLoop]: Abstraction has 6576 states and 7754 transitions. [2025-02-05 12:04:21,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 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 12:04:21,720 INFO L276 IsEmpty]: Start isEmpty. Operand 6576 states and 7754 transitions. [2025-02-05 12:04:21,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-02-05 12:04:21,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:21,722 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 12:04:21,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 12:04:21,722 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:21,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:21,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1263684772, now seen corresponding path program 1 times [2025-02-05 12:04:21,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:21,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004489460] [2025-02-05 12:04:21,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:21,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:21,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-05 12:04:21,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-05 12:04:21,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:21,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:21,905 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:04:21,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:21,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004489460] [2025-02-05 12:04:21,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004489460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:21,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:21,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:21,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310478396] [2025-02-05 12:04:21,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:21,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:21,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:21,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:21,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:21,907 INFO L87 Difference]: Start difference. First operand 6576 states and 7754 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:04:23,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:23,370 INFO L93 Difference]: Finished difference Result 16560 states and 19931 transitions. [2025-02-05 12:04:23,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:23,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2025-02-05 12:04:23,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:23,393 INFO L225 Difference]: With dead ends: 16560 [2025-02-05 12:04:23,393 INFO L226 Difference]: Without dead ends: 9986 [2025-02-05 12:04:23,401 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 12:04:23,402 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:23,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 801 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 12:04:23,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9986 states. [2025-02-05 12:04:23,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9986 to 9986. [2025-02-05 12:04:23,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9986 states, 9985 states have (on average 1.1696544817225838) internal successors, (11679), 9985 states have internal predecessors, (11679), 0 states have call successors, (0), 0 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 12:04:23,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9986 states to 9986 states and 11679 transitions. [2025-02-05 12:04:23,637 INFO L78 Accepts]: Start accepts. Automaton has 9986 states and 11679 transitions. Word has length 200 [2025-02-05 12:04:23,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:23,638 INFO L471 AbstractCegarLoop]: Abstraction has 9986 states and 11679 transitions. [2025-02-05 12:04:23,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:04:23,638 INFO L276 IsEmpty]: Start isEmpty. Operand 9986 states and 11679 transitions. [2025-02-05 12:04:23,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-05 12:04:23,644 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:23,644 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2025-02-05 12:04:23,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 12:04:23,645 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:23,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:23,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1567019455, now seen corresponding path program 1 times [2025-02-05 12:04:23,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:23,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439740341] [2025-02-05 12:04:23,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:23,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:23,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-05 12:04:23,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-05 12:04:23,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:23,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:23,873 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-05 12:04:23,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:23,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439740341] [2025-02-05 12:04:23,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439740341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:23,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:23,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:23,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988022596] [2025-02-05 12:04:23,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:23,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:23,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:23,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:23,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:23,879 INFO L87 Difference]: Start difference. First operand 9986 states and 11679 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 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 12:04:25,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:25,552 INFO L93 Difference]: Finished difference Result 25067 states and 29587 transitions. [2025-02-05 12:04:25,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:25,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 202 [2025-02-05 12:04:25,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:25,580 INFO L225 Difference]: With dead ends: 25067 [2025-02-05 12:04:25,581 INFO L226 Difference]: Without dead ends: 15083 [2025-02-05 12:04:25,590 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 12:04:25,591 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 406 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:25,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 487 Invalid, 1596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:04:25,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15083 states. [2025-02-05 12:04:25,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15083 to 10384. [2025-02-05 12:04:25,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10384 states, 10383 states have (on average 1.1651738418568813) internal successors, (12098), 10383 states have internal predecessors, (12098), 0 states have call successors, (0), 0 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 12:04:25,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10384 states to 10384 states and 12098 transitions. [2025-02-05 12:04:25,727 INFO L78 Accepts]: Start accepts. Automaton has 10384 states and 12098 transitions. Word has length 202 [2025-02-05 12:04:25,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:25,728 INFO L471 AbstractCegarLoop]: Abstraction has 10384 states and 12098 transitions. [2025-02-05 12:04:25,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 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 12:04:25,728 INFO L276 IsEmpty]: Start isEmpty. Operand 10384 states and 12098 transitions. [2025-02-05 12:04:25,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 12:04:25,730 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:25,730 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:04:25,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 12:04:25,730 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:25,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:25,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1026659161, now seen corresponding path program 1 times [2025-02-05 12:04:25,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:25,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478072896] [2025-02-05 12:04:25,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:25,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:25,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 12:04:25,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 12:04:25,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:25,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:25,920 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:04:25,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:25,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478072896] [2025-02-05 12:04:25,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478072896] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:25,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:25,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:25,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494750009] [2025-02-05 12:04:25,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:25,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:25,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:25,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:25,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:25,922 INFO L87 Difference]: Start difference. First operand 10384 states and 12098 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 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 12:04:27,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:27,918 INFO L93 Difference]: Finished difference Result 25874 states and 30417 transitions. [2025-02-05 12:04:27,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:27,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 215 [2025-02-05 12:04:27,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:27,975 INFO L225 Difference]: With dead ends: 25874 [2025-02-05 12:04:27,976 INFO L226 Difference]: Without dead ends: 15492 [2025-02-05 12:04:27,998 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 12:04:28,002 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 430 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:28,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 448 Invalid, 1648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 12:04:28,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15492 states. [2025-02-05 12:04:28,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15492 to 13778. [2025-02-05 12:04:28,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13778 states, 13777 states have (on average 1.166509399724178) internal successors, (16071), 13777 states have internal predecessors, (16071), 0 states have call successors, (0), 0 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 12:04:28,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13778 states to 13778 states and 16071 transitions. [2025-02-05 12:04:28,439 INFO L78 Accepts]: Start accepts. Automaton has 13778 states and 16071 transitions. Word has length 215 [2025-02-05 12:04:28,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:28,439 INFO L471 AbstractCegarLoop]: Abstraction has 13778 states and 16071 transitions. [2025-02-05 12:04:28,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 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 12:04:28,440 INFO L276 IsEmpty]: Start isEmpty. Operand 13778 states and 16071 transitions. [2025-02-05 12:04:28,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-02-05 12:04:28,446 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:28,446 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:04:28,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 12:04:28,446 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:28,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:28,447 INFO L85 PathProgramCache]: Analyzing trace with hash 133779585, now seen corresponding path program 1 times [2025-02-05 12:04:28,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:28,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091860084] [2025-02-05 12:04:28,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:28,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:28,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-02-05 12:04:28,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-02-05 12:04:28,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:28,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:28,619 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:04:28,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:28,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091860084] [2025-02-05 12:04:28,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091860084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:28,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:28,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:28,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651348044] [2025-02-05 12:04:28,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:28,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:28,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:28,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:28,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:28,621 INFO L87 Difference]: Start difference. First operand 13778 states and 16071 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:04:30,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:30,737 INFO L93 Difference]: Finished difference Result 32234 states and 37932 transitions. [2025-02-05 12:04:30,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:30,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 247 [2025-02-05 12:04:30,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:30,798 INFO L225 Difference]: With dead ends: 32234 [2025-02-05 12:04:30,798 INFO L226 Difference]: Without dead ends: 18458 [2025-02-05 12:04:30,821 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 12:04:30,826 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 444 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:30,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 416 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 12:04:30,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18458 states. [2025-02-05 12:04:31,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18458 to 17176. [2025-02-05 12:04:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17176 states, 17175 states have (on average 1.1833478893740903) internal successors, (20324), 17175 states have internal predecessors, (20324), 0 states have call successors, (0), 0 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 12:04:31,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17176 states to 17176 states and 20324 transitions. [2025-02-05 12:04:31,203 INFO L78 Accepts]: Start accepts. Automaton has 17176 states and 20324 transitions. Word has length 247 [2025-02-05 12:04:31,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:31,203 INFO L471 AbstractCegarLoop]: Abstraction has 17176 states and 20324 transitions. [2025-02-05 12:04:31,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:04:31,204 INFO L276 IsEmpty]: Start isEmpty. Operand 17176 states and 20324 transitions. [2025-02-05 12:04:31,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-02-05 12:04:31,206 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:31,207 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:04:31,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 12:04:31,207 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:31,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:31,208 INFO L85 PathProgramCache]: Analyzing trace with hash -786147823, now seen corresponding path program 1 times [2025-02-05 12:04:31,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:31,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633266788] [2025-02-05 12:04:31,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:31,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:31,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-02-05 12:04:31,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-02-05 12:04:31,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:31,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:31,408 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:04:31,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:31,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633266788] [2025-02-05 12:04:31,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633266788] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:31,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:31,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:31,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009321113] [2025-02-05 12:04:31,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:31,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:31,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:31,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:31,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:31,409 INFO L87 Difference]: Start difference. First operand 17176 states and 20324 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 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 12:04:33,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:33,132 INFO L93 Difference]: Finished difference Result 39057 states and 46415 transitions. [2025-02-05 12:04:33,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:33,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 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 264 [2025-02-05 12:04:33,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:33,164 INFO L225 Difference]: With dead ends: 39057 [2025-02-05 12:04:33,164 INFO L226 Difference]: Without dead ends: 21458 [2025-02-05 12:04:33,181 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 12:04:33,181 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 356 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:33,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 864 Invalid, 1580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:04:33,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21458 states. [2025-02-05 12:04:33,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21458 to 21025. [2025-02-05 12:04:33,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21025 states, 21024 states have (on average 1.1667142313546424) internal successors, (24529), 21024 states have internal predecessors, (24529), 0 states have call successors, (0), 0 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 12:04:33,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21025 states to 21025 states and 24529 transitions. [2025-02-05 12:04:33,496 INFO L78 Accepts]: Start accepts. Automaton has 21025 states and 24529 transitions. Word has length 264 [2025-02-05 12:04:33,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:33,496 INFO L471 AbstractCegarLoop]: Abstraction has 21025 states and 24529 transitions. [2025-02-05 12:04:33,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 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 12:04:33,497 INFO L276 IsEmpty]: Start isEmpty. Operand 21025 states and 24529 transitions. [2025-02-05 12:04:33,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-02-05 12:04:33,499 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:33,499 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:04:33,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 12:04:33,500 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:33,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:33,500 INFO L85 PathProgramCache]: Analyzing trace with hash -879388953, now seen corresponding path program 1 times [2025-02-05 12:04:33,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:33,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633351386] [2025-02-05 12:04:33,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:33,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:33,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-05 12:04:33,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-05 12:04:33,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:33,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:33,745 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 230 proven. 70 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 12:04:33,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:33,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633351386] [2025-02-05 12:04:33,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633351386] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:04:33,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161874751] [2025-02-05 12:04:33,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:33,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:04:33,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:04:33,748 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 12:04:33,750 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 12:04:33,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-05 12:04:34,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-05 12:04:34,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:34,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:34,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 12:04:34,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:04:34,462 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 230 proven. 70 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 12:04:34,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:04:34,695 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 12:04:34,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161874751] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 12:04:34,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 12:04:34,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-02-05 12:04:34,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771747283] [2025-02-05 12:04:34,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:34,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:04:34,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:34,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:04:34,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:04:34,696 INFO L87 Difference]: Start difference. First operand 21025 states and 24529 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 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 12:04:37,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:37,729 INFO L93 Difference]: Finished difference Result 59100 states and 69388 transitions. [2025-02-05 12:04:37,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:04:37,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 272 [2025-02-05 12:04:37,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:37,794 INFO L225 Difference]: With dead ends: 59100 [2025-02-05 12:04:37,794 INFO L226 Difference]: Without dead ends: 37213 [2025-02-05 12:04:37,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 541 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:04:37,809 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 878 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 2289 mSolverCounterSat, 726 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 3015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 726 IncrementalHoareTripleChecker+Valid, 2289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:37,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 157 Invalid, 3015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [726 Valid, 2289 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 12:04:37,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37213 states. [2025-02-05 12:04:38,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37213 to 35506. [2025-02-05 12:04:38,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35506 states, 35505 states have (on average 1.1591043514997887) internal successors, (41154), 35505 states have internal predecessors, (41154), 0 states have call successors, (0), 0 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 12:04:38,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35506 states to 35506 states and 41154 transitions. [2025-02-05 12:04:38,167 INFO L78 Accepts]: Start accepts. Automaton has 35506 states and 41154 transitions. Word has length 272 [2025-02-05 12:04:38,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:38,167 INFO L471 AbstractCegarLoop]: Abstraction has 35506 states and 41154 transitions. [2025-02-05 12:04:38,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 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 12:04:38,167 INFO L276 IsEmpty]: Start isEmpty. Operand 35506 states and 41154 transitions. [2025-02-05 12:04:38,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-02-05 12:04:38,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:38,169 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-02-05 12:04:38,180 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 12:04:38,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 12:04:38,374 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:38,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:38,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1295257950, now seen corresponding path program 1 times [2025-02-05 12:04:38,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:38,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707202749] [2025-02-05 12:04:38,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:38,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:38,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-02-05 12:04:38,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-02-05 12:04:38,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:38,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:38,535 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-02-05 12:04:38,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:38,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707202749] [2025-02-05 12:04:38,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707202749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:38,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:38,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:38,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069213963] [2025-02-05 12:04:38,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:38,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:38,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:38,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:38,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:38,538 INFO L87 Difference]: Start difference. First operand 35506 states and 41154 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 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 12:04:40,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:40,394 INFO L93 Difference]: Finished difference Result 78654 states and 91329 transitions. [2025-02-05 12:04:40,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:40,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 280 [2025-02-05 12:04:40,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:40,518 INFO L225 Difference]: With dead ends: 78654 [2025-02-05 12:04:40,519 INFO L226 Difference]: Without dead ends: 42723 [2025-02-05 12:04:40,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 12:04:40,582 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 380 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:40,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 850 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:04:40,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42723 states. [2025-02-05 12:04:41,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42723 to 42723. [2025-02-05 12:04:41,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42723 states, 42722 states have (on average 1.1170825335892514) internal successors, (47724), 42722 states have internal predecessors, (47724), 0 states have call successors, (0), 0 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 12:04:41,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42723 states to 42723 states and 47724 transitions. [2025-02-05 12:04:41,405 INFO L78 Accepts]: Start accepts. Automaton has 42723 states and 47724 transitions. Word has length 280 [2025-02-05 12:04:41,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:41,406 INFO L471 AbstractCegarLoop]: Abstraction has 42723 states and 47724 transitions. [2025-02-05 12:04:41,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 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 12:04:41,406 INFO L276 IsEmpty]: Start isEmpty. Operand 42723 states and 47724 transitions. [2025-02-05 12:04:41,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-02-05 12:04:41,416 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:41,416 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:04:41,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 12:04:41,417 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:41,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:41,418 INFO L85 PathProgramCache]: Analyzing trace with hash -760730359, now seen corresponding path program 1 times [2025-02-05 12:04:41,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:41,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171870795] [2025-02-05 12:04:41,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:41,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:41,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-02-05 12:04:41,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-02-05 12:04:41,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:41,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:41,851 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 371 proven. 73 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-02-05 12:04:41,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:41,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171870795] [2025-02-05 12:04:41,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171870795] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:04:41,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990147007] [2025-02-05 12:04:41,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:41,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:04:41,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:04:41,857 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 12:04:41,862 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 12:04:41,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-02-05 12:04:41,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-02-05 12:04:41,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:41,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:41,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 12:04:41,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:04:42,125 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 371 proven. 73 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-02-05 12:04:42,127 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:04:42,358 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 444 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-02-05 12:04:42,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990147007] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 12:04:42,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 12:04:42,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-02-05 12:04:42,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665108722] [2025-02-05 12:04:42,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:42,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:04:42,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:42,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:04:42,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:04:42,360 INFO L87 Difference]: Start difference. First operand 42723 states and 47724 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 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 12:04:45,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:45,022 INFO L93 Difference]: Finished difference Result 101643 states and 113664 transitions. [2025-02-05 12:04:45,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:04:45,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 346 [2025-02-05 12:04:45,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:45,104 INFO L225 Difference]: With dead ends: 101643 [2025-02-05 12:04:45,104 INFO L226 Difference]: Without dead ends: 58493 [2025-02-05 12:04:45,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 689 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:04:45,145 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 879 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 2297 mSolverCounterSat, 574 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 2871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 574 IncrementalHoareTripleChecker+Valid, 2297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:45,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 172 Invalid, 2871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [574 Valid, 2297 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 12:04:45,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58493 states. [2025-02-05 12:04:45,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58493 to 55940. [2025-02-05 12:04:45,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55940 states, 55939 states have (on average 1.1210604408373406) internal successors, (62711), 55939 states have internal predecessors, (62711), 0 states have call successors, (0), 0 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 12:04:45,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55940 states to 55940 states and 62711 transitions. [2025-02-05 12:04:45,968 INFO L78 Accepts]: Start accepts. Automaton has 55940 states and 62711 transitions. Word has length 346 [2025-02-05 12:04:45,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:45,968 INFO L471 AbstractCegarLoop]: Abstraction has 55940 states and 62711 transitions. [2025-02-05 12:04:45,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 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 12:04:45,969 INFO L276 IsEmpty]: Start isEmpty. Operand 55940 states and 62711 transitions. [2025-02-05 12:04:45,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-02-05 12:04:45,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:45,976 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:45,986 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 12:04:46,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:04:46,177 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:46,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:46,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1473370361, now seen corresponding path program 1 times [2025-02-05 12:04:46,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:46,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528331220] [2025-02-05 12:04:46,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:46,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:46,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-02-05 12:04:46,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-02-05 12:04:46,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:46,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:46,462 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 444 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-02-05 12:04:46,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:46,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528331220] [2025-02-05 12:04:46,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528331220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:46,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:46,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:46,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244182921] [2025-02-05 12:04:46,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:46,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:46,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:46,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:46,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:46,464 INFO L87 Difference]: Start difference. First operand 55940 states and 62711 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 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 12:04:48,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:48,213 INFO L93 Difference]: Finished difference Result 121241 states and 135987 transitions. [2025-02-05 12:04:48,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:48,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 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 443 [2025-02-05 12:04:48,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:48,297 INFO L225 Difference]: With dead ends: 121241 [2025-02-05 12:04:48,297 INFO L226 Difference]: Without dead ends: 64878 [2025-02-05 12:04:48,319 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 12:04:48,319 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 339 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:48,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 774 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 12:04:48,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64878 states. [2025-02-05 12:04:48,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64878 to 53350. [2025-02-05 12:04:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53350 states, 53349 states have (on average 1.1076871169094078) internal successors, (59094), 53349 states have internal predecessors, (59094), 0 states have call successors, (0), 0 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 12:04:48,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53350 states to 53350 states and 59094 transitions. [2025-02-05 12:04:48,982 INFO L78 Accepts]: Start accepts. Automaton has 53350 states and 59094 transitions. Word has length 443 [2025-02-05 12:04:48,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:48,984 INFO L471 AbstractCegarLoop]: Abstraction has 53350 states and 59094 transitions. [2025-02-05 12:04:48,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 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 12:04:48,984 INFO L276 IsEmpty]: Start isEmpty. Operand 53350 states and 59094 transitions. [2025-02-05 12:04:48,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-02-05 12:04:48,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:48,990 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:04:48,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 12:04:48,991 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:48,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:48,991 INFO L85 PathProgramCache]: Analyzing trace with hash 2076857552, now seen corresponding path program 1 times [2025-02-05 12:04:48,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:48,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553790083] [2025-02-05 12:04:48,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:48,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:49,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-02-05 12:04:49,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-02-05 12:04:49,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:49,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:49,712 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-02-05 12:04:49,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:49,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553790083] [2025-02-05 12:04:49,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553790083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:49,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:49,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:49,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060379663] [2025-02-05 12:04:49,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:49,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:49,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:49,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:49,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:49,718 INFO L87 Difference]: Start difference. First operand 53350 states and 59094 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 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 12:04:51,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:51,409 INFO L93 Difference]: Finished difference Result 119901 states and 132834 transitions. [2025-02-05 12:04:51,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:51,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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 444 [2025-02-05 12:04:51,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:51,483 INFO L225 Difference]: With dead ends: 119901 [2025-02-05 12:04:51,484 INFO L226 Difference]: Without dead ends: 63990 [2025-02-05 12:04:51,517 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 12:04:51,520 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 437 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:51,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 659 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 12:04:51,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63990 states. [2025-02-05 12:04:52,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63990 to 61851. [2025-02-05 12:04:52,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61851 states, 61850 states have (on average 1.0961196443007275) internal successors, (67795), 61850 states have internal predecessors, (67795), 0 states have call successors, (0), 0 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 12:04:52,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61851 states to 61851 states and 67795 transitions. [2025-02-05 12:04:52,355 INFO L78 Accepts]: Start accepts. Automaton has 61851 states and 67795 transitions. Word has length 444 [2025-02-05 12:04:52,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:52,356 INFO L471 AbstractCegarLoop]: Abstraction has 61851 states and 67795 transitions. [2025-02-05 12:04:52,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 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 12:04:52,356 INFO L276 IsEmpty]: Start isEmpty. Operand 61851 states and 67795 transitions. [2025-02-05 12:04:52,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-02-05 12:04:52,363 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:52,364 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:52,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 12:04:52,364 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:52,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:52,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1970309845, now seen corresponding path program 1 times [2025-02-05 12:04:52,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:52,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617775983] [2025-02-05 12:04:52,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:52,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:52,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-02-05 12:04:52,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-02-05 12:04:52,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:52,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:52,862 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 12:04:52,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:52,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617775983] [2025-02-05 12:04:52,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617775983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:52,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:52,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:04:52,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501725194] [2025-02-05 12:04:52,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:52,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:04:52,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:52,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:04:52,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:04:52,864 INFO L87 Difference]: Start difference. First operand 61851 states and 67795 transitions. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 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 12:04:55,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:55,462 INFO L93 Difference]: Finished difference Result 145471 states and 159571 transitions. [2025-02-05 12:04:55,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:04:55,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 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 448 [2025-02-05 12:04:55,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:55,575 INFO L225 Difference]: With dead ends: 145471 [2025-02-05 12:04:55,576 INFO L226 Difference]: Without dead ends: 83622 [2025-02-05 12:04:55,617 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 12:04:55,619 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 828 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 2316 mSolverCounterSat, 463 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 2779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 463 IncrementalHoareTripleChecker+Valid, 2316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:55,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 207 Invalid, 2779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [463 Valid, 2316 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 12:04:55,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83622 states. [2025-02-05 12:04:56,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83622 to 78925. [2025-02-05 12:04:56,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78925 states, 78924 states have (on average 1.097967665095535) internal successors, (86656), 78924 states have internal predecessors, (86656), 0 states have call successors, (0), 0 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 12:04:57,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78925 states to 78925 states and 86656 transitions. [2025-02-05 12:04:57,076 INFO L78 Accepts]: Start accepts. Automaton has 78925 states and 86656 transitions. Word has length 448 [2025-02-05 12:04:57,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:04:57,076 INFO L471 AbstractCegarLoop]: Abstraction has 78925 states and 86656 transitions. [2025-02-05 12:04:57,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 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 12:04:57,076 INFO L276 IsEmpty]: Start isEmpty. Operand 78925 states and 86656 transitions. [2025-02-05 12:04:57,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-02-05 12:04:57,083 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:04:57,083 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:04:57,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 12:04:57,083 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:04:57,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:04:57,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1113319179, now seen corresponding path program 1 times [2025-02-05 12:04:57,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:04:57,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907187952] [2025-02-05 12:04:57,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:04:57,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:04:57,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-02-05 12:04:57,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-02-05 12:04:57,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:04:57,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:04:57,413 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 602 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-02-05 12:04:57,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:04:57,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907187952] [2025-02-05 12:04:57,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907187952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:04:57,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:04:57,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:04:57,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771147603] [2025-02-05 12:04:57,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:04:57,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:04:57,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:04:57,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:04:57,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:04:57,415 INFO L87 Difference]: Start difference. First operand 78925 states and 86656 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 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 12:04:59,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:04:59,125 INFO L93 Difference]: Finished difference Result 167641 states and 184227 transitions. [2025-02-05 12:04:59,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:04:59,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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 467 [2025-02-05 12:04:59,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:04:59,243 INFO L225 Difference]: With dead ends: 167641 [2025-02-05 12:04:59,243 INFO L226 Difference]: Without dead ends: 88718 [2025-02-05 12:04:59,303 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 12:04:59,304 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 386 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:04:59,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 326 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 12:04:59,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88718 states. [2025-02-05 12:05:00,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88718 to 88286. [2025-02-05 12:05:00,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88286 states, 88285 states have (on average 1.0953389590530667) internal successors, (96702), 88285 states have internal predecessors, (96702), 0 states have call successors, (0), 0 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 12:05:00,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88286 states to 88286 states and 96702 transitions. [2025-02-05 12:05:00,716 INFO L78 Accepts]: Start accepts. Automaton has 88286 states and 96702 transitions. Word has length 467 [2025-02-05 12:05:00,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:00,716 INFO L471 AbstractCegarLoop]: Abstraction has 88286 states and 96702 transitions. [2025-02-05 12:05:00,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 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 12:05:00,717 INFO L276 IsEmpty]: Start isEmpty. Operand 88286 states and 96702 transitions. [2025-02-05 12:05:00,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-02-05 12:05:00,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:00,739 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2025-02-05 12:05:00,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 12:05:00,743 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:00,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:00,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1400596364, now seen corresponding path program 1 times [2025-02-05 12:05:00,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:00,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769114579] [2025-02-05 12:05:00,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:00,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:00,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-02-05 12:05:00,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-02-05 12:05:00,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:00,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:01,502 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2025-02-05 12:05:01,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:01,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769114579] [2025-02-05 12:05:01,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769114579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:01,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:01,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:05:01,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337191767] [2025-02-05 12:05:01,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:01,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:01,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:01,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:01,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:01,505 INFO L87 Difference]: Start difference. First operand 88286 states and 96702 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 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 12:05:03,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:03,401 INFO L93 Difference]: Finished difference Result 190190 states and 208577 transitions. [2025-02-05 12:05:03,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:03,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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 491 [2025-02-05 12:05:03,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:03,541 INFO L225 Difference]: With dead ends: 190190 [2025-02-05 12:05:03,541 INFO L226 Difference]: Without dead ends: 101906 [2025-02-05 12:05:03,584 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 12:05:03,585 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 475 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:03,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 264 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 12:05:03,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101906 states. [2025-02-05 12:05:04,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101906 to 101449. [2025-02-05 12:05:04,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101449 states, 101448 states have (on average 1.0927963094393187) internal successors, (110862), 101448 states have internal predecessors, (110862), 0 states have call successors, (0), 0 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 12:05:05,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101449 states to 101449 states and 110862 transitions. [2025-02-05 12:05:05,044 INFO L78 Accepts]: Start accepts. Automaton has 101449 states and 110862 transitions. Word has length 491 [2025-02-05 12:05:05,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:05,048 INFO L471 AbstractCegarLoop]: Abstraction has 101449 states and 110862 transitions. [2025-02-05 12:05:05,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 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 12:05:05,049 INFO L276 IsEmpty]: Start isEmpty. Operand 101449 states and 110862 transitions. [2025-02-05 12:05:05,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-02-05 12:05:05,060 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:05,060 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:05:05,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 12:05:05,060 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:05,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:05,061 INFO L85 PathProgramCache]: Analyzing trace with hash 641263300, now seen corresponding path program 1 times [2025-02-05 12:05:05,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:05,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523512707] [2025-02-05 12:05:05,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:05,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:05,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-02-05 12:05:05,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-02-05 12:05:05,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:05,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:05,349 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-05 12:05:05,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:05,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523512707] [2025-02-05 12:05:05,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523512707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:05,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:05,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:05:05,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333611625] [2025-02-05 12:05:05,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:05,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:05,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:05,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:05,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:05,351 INFO L87 Difference]: Start difference. First operand 101449 states and 110862 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 12:05:07,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:07,497 INFO L93 Difference]: Finished difference Result 208447 states and 227581 transitions. [2025-02-05 12:05:07,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:07,498 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 494 [2025-02-05 12:05:07,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:07,872 INFO L225 Difference]: With dead ends: 208447 [2025-02-05 12:05:07,873 INFO L226 Difference]: Without dead ends: 105293 [2025-02-05 12:05:07,914 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 12:05:07,915 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 401 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:07,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 807 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:05:07,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105293 states. [2025-02-05 12:05:08,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105293 to 102292. [2025-02-05 12:05:08,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102292 states, 102291 states have (on average 1.0912103704138194) internal successors, (111621), 102291 states have internal predecessors, (111621), 0 states have call successors, (0), 0 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 12:05:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102292 states to 102292 states and 111621 transitions. [2025-02-05 12:05:09,060 INFO L78 Accepts]: Start accepts. Automaton has 102292 states and 111621 transitions. Word has length 494 [2025-02-05 12:05:09,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:09,061 INFO L471 AbstractCegarLoop]: Abstraction has 102292 states and 111621 transitions. [2025-02-05 12:05:09,061 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 12:05:09,061 INFO L276 IsEmpty]: Start isEmpty. Operand 102292 states and 111621 transitions. [2025-02-05 12:05:09,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-02-05 12:05:09,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:09,074 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 12:05:09,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 12:05:09,074 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:09,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:09,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1310193056, now seen corresponding path program 1 times [2025-02-05 12:05:09,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:09,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901554036] [2025-02-05 12:05:09,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:09,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:09,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-02-05 12:05:09,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-02-05 12:05:09,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:09,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:10,626 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 651 proven. 29 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-02-05 12:05:10,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:10,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901554036] [2025-02-05 12:05:10,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901554036] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:05:10,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817370205] [2025-02-05 12:05:10,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:10,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:05:10,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:05:10,629 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 12:05:10,631 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 12:05:10,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-02-05 12:05:10,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-02-05 12:05:10,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:10,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:10,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 12:05:10,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:05:11,036 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-02-05 12:05:11,036 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:05:11,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817370205] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:11,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 12:05:11,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-02-05 12:05:11,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137137583] [2025-02-05 12:05:11,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:11,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:11,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:11,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:11,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 12:05:11,038 INFO L87 Difference]: Start difference. First operand 102292 states and 111621 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 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 12:05:14,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:14,177 INFO L93 Difference]: Finished difference Result 209694 states and 228650 transitions. [2025-02-05 12:05:14,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:14,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 532 [2025-02-05 12:05:14,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:14,318 INFO L225 Difference]: With dead ends: 209694 [2025-02-05 12:05:14,318 INFO L226 Difference]: Without dead ends: 107402 [2025-02-05 12:05:14,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 12:05:14,348 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 411 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:14,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 785 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 12:05:14,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107402 states. [2025-02-05 12:05:15,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107402 to 104421. [2025-02-05 12:05:15,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104421 states, 104420 states have (on average 1.0889580540126413) internal successors, (113709), 104420 states have internal predecessors, (113709), 0 states have call successors, (0), 0 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 12:05:15,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104421 states to 104421 states and 113709 transitions. [2025-02-05 12:05:15,650 INFO L78 Accepts]: Start accepts. Automaton has 104421 states and 113709 transitions. Word has length 532 [2025-02-05 12:05:15,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:15,650 INFO L471 AbstractCegarLoop]: Abstraction has 104421 states and 113709 transitions. [2025-02-05 12:05:15,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 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 12:05:15,657 INFO L276 IsEmpty]: Start isEmpty. Operand 104421 states and 113709 transitions. [2025-02-05 12:05:15,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2025-02-05 12:05:15,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:15,673 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:05:15,680 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 12:05:15,874 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 12:05:15,874 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:15,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:15,875 INFO L85 PathProgramCache]: Analyzing trace with hash -452521784, now seen corresponding path program 1 times [2025-02-05 12:05:15,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:15,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680171495] [2025-02-05 12:05:15,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:15,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:15,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-02-05 12:05:15,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-02-05 12:05:15,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:15,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:16,346 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-05 12:05:16,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:16,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680171495] [2025-02-05 12:05:16,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680171495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:16,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:16,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:05:16,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849502481] [2025-02-05 12:05:16,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:16,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:16,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:16,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:16,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:16,348 INFO L87 Difference]: Start difference. First operand 104421 states and 113709 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 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 12:05:18,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:18,796 INFO L93 Difference]: Finished difference Result 215230 states and 234145 transitions. [2025-02-05 12:05:18,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:18,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 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 539 [2025-02-05 12:05:18,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:18,955 INFO L225 Difference]: With dead ends: 215230 [2025-02-05 12:05:18,956 INFO L226 Difference]: Without dead ends: 110800 [2025-02-05 12:05:19,009 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 12:05:19,009 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 446 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:19,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 660 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1231 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 12:05:19,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110800 states. [2025-02-05 12:05:20,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110800 to 107377. [2025-02-05 12:05:20,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107377 states, 107376 states have (on average 1.0782670242884815) internal successors, (115780), 107376 states have internal predecessors, (115780), 0 states have call successors, (0), 0 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 12:05:20,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107377 states to 107377 states and 115780 transitions. [2025-02-05 12:05:20,407 INFO L78 Accepts]: Start accepts. Automaton has 107377 states and 115780 transitions. Word has length 539 [2025-02-05 12:05:20,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:20,408 INFO L471 AbstractCegarLoop]: Abstraction has 107377 states and 115780 transitions. [2025-02-05 12:05:20,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 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 12:05:20,408 INFO L276 IsEmpty]: Start isEmpty. Operand 107377 states and 115780 transitions. [2025-02-05 12:05:20,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2025-02-05 12:05:20,419 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:20,419 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:05:20,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 12:05:20,420 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:20,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:20,420 INFO L85 PathProgramCache]: Analyzing trace with hash -959599247, now seen corresponding path program 1 times [2025-02-05 12:05:20,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:20,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296701396] [2025-02-05 12:05:20,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:20,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:20,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 580 statements into 1 equivalence classes. [2025-02-05 12:05:20,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 580 of 580 statements. [2025-02-05 12:05:20,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:20,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:21,450 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 485 proven. 46 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-02-05 12:05:21,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:21,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296701396] [2025-02-05 12:05:21,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296701396] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:05:21,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290693559] [2025-02-05 12:05:21,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:21,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:05:21,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:05:21,454 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 12:05:21,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 12:05:21,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 580 statements into 1 equivalence classes. [2025-02-05 12:05:21,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 580 of 580 statements. [2025-02-05 12:05:21,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:21,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:21,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 12:05:21,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:05:23,154 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 485 proven. 46 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-02-05 12:05:23,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:05:24,486 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 531 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-02-05 12:05:24,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290693559] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 12:05:24,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 12:05:24,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 8 [2025-02-05 12:05:24,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418459809] [2025-02-05 12:05:24,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:24,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:05:24,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:24,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:05:24,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 12:05:24,489 INFO L87 Difference]: Start difference. First operand 107377 states and 115780 transitions. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 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 12:05:27,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:27,509 INFO L93 Difference]: Finished difference Result 224993 states and 242507 transitions. [2025-02-05 12:05:27,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:05:27,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 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 580 [2025-02-05 12:05:27,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:27,661 INFO L225 Difference]: With dead ends: 224993 [2025-02-05 12:05:27,661 INFO L226 Difference]: Without dead ends: 117192 [2025-02-05 12:05:27,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1163 GetRequests, 1157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 12:05:27,734 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 733 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 2326 mSolverCounterSat, 465 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 2791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 465 IncrementalHoareTripleChecker+Valid, 2326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:27,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 110 Invalid, 2791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [465 Valid, 2326 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 12:05:27,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117192 states. [2025-02-05 12:05:28,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117192 to 107801. [2025-02-05 12:05:28,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107801 states, 107800 states have (on average 1.0776345083487942) internal successors, (116169), 107800 states have internal predecessors, (116169), 0 states have call successors, (0), 0 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 12:05:28,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107801 states to 107801 states and 116169 transitions. [2025-02-05 12:05:28,974 INFO L78 Accepts]: Start accepts. Automaton has 107801 states and 116169 transitions. Word has length 580 [2025-02-05 12:05:28,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:28,974 INFO L471 AbstractCegarLoop]: Abstraction has 107801 states and 116169 transitions. [2025-02-05 12:05:28,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 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 12:05:28,975 INFO L276 IsEmpty]: Start isEmpty. Operand 107801 states and 116169 transitions. [2025-02-05 12:05:28,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2025-02-05 12:05:28,996 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:28,996 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:05:29,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 12:05:29,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-02-05 12:05:29,197 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:29,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:29,198 INFO L85 PathProgramCache]: Analyzing trace with hash 116042801, now seen corresponding path program 1 times [2025-02-05 12:05:29,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:29,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500800237] [2025-02-05 12:05:29,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:29,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:29,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes. [2025-02-05 12:05:29,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements. [2025-02-05 12:05:29,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:29,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:29,844 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-02-05 12:05:29,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:29,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500800237] [2025-02-05 12:05:29,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500800237] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:29,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:29,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:05:29,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69455251] [2025-02-05 12:05:29,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:29,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:05:29,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:29,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:05:29,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:05:29,846 INFO L87 Difference]: Start difference. First operand 107801 states and 116169 transitions. Second operand has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 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 12:05:32,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:32,366 INFO L93 Difference]: Finished difference Result 234375 states and 252432 transitions. [2025-02-05 12:05:32,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:05:32,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 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 623 [2025-02-05 12:05:32,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:32,537 INFO L225 Difference]: With dead ends: 234375 [2025-02-05 12:05:32,538 INFO L226 Difference]: Without dead ends: 126576 [2025-02-05 12:05:32,608 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 12:05:32,609 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 655 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 2509 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 2618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:32,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 312 Invalid, 2618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2509 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 12:05:32,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126576 states.