./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label59.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label59.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 51dcd89c10622c543bf9ef783ec22401c3170140113dd2b2907b165950bd75af --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:40:54,510 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:40:54,548 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:40:54,551 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:40:54,551 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:40:54,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:40:54,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:40:54,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:40:54,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:40:54,566 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:40:54,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:40:54,566 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:40:54,566 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:40:54,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:40:54,566 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:40:54,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:40:54,566 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:40:54,566 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:40:54,567 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:40:54,567 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:40:54,567 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:40:54,567 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:40:54,567 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:40:54,567 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:40:54,567 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:40:54,567 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:40:54,567 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:40:54,567 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:40:54,568 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:40:54,568 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:40:54,568 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:40:54,568 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:40:54,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:40:54,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:40:54,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:40:54,568 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:40:54,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:40:54,568 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:40:54,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:40:54,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:40:54,569 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:40:54,569 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:40:54,569 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:40:54,569 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 -> 51dcd89c10622c543bf9ef783ec22401c3170140113dd2b2907b165950bd75af [2025-02-05 11:40:54,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:40:54,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:40:54,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:40:54,751 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:40:54,751 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:40:54,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label59.c [2025-02-05 11:40:55,918 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4eb147a8f/05b2c883161247a8bf1e4901c251c6a3/FLAG76ad5b7b0 [2025-02-05 11:40:56,397 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:40:56,399 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label59.c [2025-02-05 11:40:56,429 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4eb147a8f/05b2c883161247a8bf1e4901c251c6a3/FLAG76ad5b7b0 [2025-02-05 11:40:56,503 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4eb147a8f/05b2c883161247a8bf1e4901c251c6a3 [2025-02-05 11:40:56,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:40:56,506 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:40:56,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:40:56,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:40:56,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:40:56,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:40:56" (1/1) ... [2025-02-05 11:40:56,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fb74559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:40:56, skipping insertion in model container [2025-02-05 11:40:56,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:40:56" (1/1) ... [2025-02-05 11:40:56,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:40:56,780 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label59.c[5577,5590] [2025-02-05 11:40:57,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:40:57,331 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:40:57,346 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label59.c[5577,5590] [2025-02-05 11:40:57,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:40:57,628 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:40:57,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:40:57 WrapperNode [2025-02-05 11:40:57,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:40:57,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:40:57,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:40:57,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:40:57,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:40:57" (1/1) ... [2025-02-05 11:40:57,685 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:40:57" (1/1) ... [2025-02-05 11:40:57,928 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-02-05 11:40:57,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:40:57,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:40:57,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:40:57,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:40:57,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:40:57" (1/1) ... [2025-02-05 11:40:57,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:40:57" (1/1) ... [2025-02-05 11:40:57,976 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:40:57" (1/1) ... [2025-02-05 11:40:58,105 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 11:40:58,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:40:57" (1/1) ... [2025-02-05 11:40:58,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:40:57" (1/1) ... [2025-02-05 11:40:58,204 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:40:57" (1/1) ... [2025-02-05 11:40:58,221 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:40:57" (1/1) ... [2025-02-05 11:40:58,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:40:57" (1/1) ... [2025-02-05 11:40:58,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:40:57" (1/1) ... [2025-02-05 11:40:58,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:40:58,287 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:40:58,288 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:40:58,288 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:40:58,289 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:40:57" (1/1) ... [2025-02-05 11:40:58,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:40:58,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:40:58,314 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 11:40:58,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 11:40:58,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:40:58,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:40:58,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:40:58,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:40:58,387 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:40:58,389 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:41:01,821 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-02-05 11:41:01,821 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-02-05 11:41:01,822 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-02-05 11:41:02,027 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-02-05 11:41:02,027 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:41:02,061 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:41:02,061 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:41:02,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:41:02 BoogieIcfgContainer [2025-02-05 11:41:02,062 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:41:02,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:41:02,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:41:02,069 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:41:02,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:40:56" (1/3) ... [2025-02-05 11:41:02,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64858f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:41:02, skipping insertion in model container [2025-02-05 11:41:02,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:40:57" (2/3) ... [2025-02-05 11:41:02,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64858f24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:41:02, skipping insertion in model container [2025-02-05 11:41:02,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:41:02" (3/3) ... [2025-02-05 11:41:02,072 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label59.c [2025-02-05 11:41:02,084 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:41:02,086 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label59.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:41:02,158 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:41:02,169 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;@154a2172, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:41:02,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:41:02,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:02,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 11:41:02,183 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:02,184 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] [2025-02-05 11:41:02,184 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:02,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:02,189 INFO L85 PathProgramCache]: Analyzing trace with hash -282227835, now seen corresponding path program 1 times [2025-02-05 11:41:02,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:02,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625928401] [2025-02-05 11:41:02,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:02,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:02,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 11:41:02,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 11:41:02,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:02,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:02,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:41:02,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:02,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625928401] [2025-02-05 11:41:02,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625928401] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:02,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:02,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:41:02,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101784111] [2025-02-05 11:41:02,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:02,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:41:02,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:02,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:41:02,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:02,477 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:05,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:05,535 INFO L93 Difference]: Finished difference Result 2388 states and 4626 transitions. [2025-02-05 11:41:05,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:41:05,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-02-05 11:41:05,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:05,553 INFO L225 Difference]: With dead ends: 2388 [2025-02-05 11:41:05,553 INFO L226 Difference]: Without dead ends: 1506 [2025-02-05 11:41:05,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:05,559 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 792 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2500 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 3264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:05,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 112 Invalid, 3264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2500 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 11:41:05,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-02-05 11:41:05,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-02-05 11:41:05,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.86578073089701) internal successors, (2808), 1505 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:05,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2808 transitions. [2025-02-05 11:41:05,664 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2808 transitions. Word has length 44 [2025-02-05 11:41:05,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:05,664 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2808 transitions. [2025-02-05 11:41:05,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:05,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2808 transitions. [2025-02-05 11:41:05,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 11:41:05,667 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:05,667 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:41:05,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:41:05,668 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:05,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:05,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1520006424, now seen corresponding path program 1 times [2025-02-05 11:41:05,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:05,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461091586] [2025-02-05 11:41:05,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:05,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:05,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 11:41:05,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 11:41:05,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:05,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:05,903 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:41:05,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:05,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461091586] [2025-02-05 11:41:05,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461091586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:05,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:05,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:41:05,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191286493] [2025-02-05 11:41:05,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:05,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:41:05,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:05,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:41:05,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:05,905 INFO L87 Difference]: Start difference. First operand 1506 states and 2808 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:08,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:08,507 INFO L93 Difference]: Finished difference Result 4514 states and 8420 transitions. [2025-02-05 11:41:08,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:41:08,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-02-05 11:41:08,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:08,517 INFO L225 Difference]: With dead ends: 4514 [2025-02-05 11:41:08,517 INFO L226 Difference]: Without dead ends: 3010 [2025-02-05 11:41:08,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:08,521 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 926 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:08,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 353 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:41:08,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2025-02-05 11:41:08,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 3008. [2025-02-05 11:41:08,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.6511473229132025) internal successors, (4965), 3007 states have internal predecessors, (4965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:08,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4965 transitions. [2025-02-05 11:41:08,570 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4965 transitions. Word has length 109 [2025-02-05 11:41:08,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:08,571 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4965 transitions. [2025-02-05 11:41:08,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:08,571 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4965 transitions. [2025-02-05 11:41:08,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 11:41:08,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:08,572 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:41:08,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:41:08,573 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:08,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:08,577 INFO L85 PathProgramCache]: Analyzing trace with hash 647078345, now seen corresponding path program 1 times [2025-02-05 11:41:08,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:08,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998015586] [2025-02-05 11:41:08,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:08,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:08,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 11:41:08,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 11:41:08,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:08,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:08,882 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:41:08,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:08,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998015586] [2025-02-05 11:41:08,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998015586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:08,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:08,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:41:08,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335234840] [2025-02-05 11:41:08,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:08,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:41:08,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:08,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:41:08,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:41:08,884 INFO L87 Difference]: Start difference. First operand 3008 states and 4965 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 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 11:41:11,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:11,551 INFO L93 Difference]: Finished difference Result 7555 states and 12123 transitions. [2025-02-05 11:41:11,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:41:11,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 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 11:41:11,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:11,563 INFO L225 Difference]: With dead ends: 7555 [2025-02-05 11:41:11,563 INFO L226 Difference]: Without dead ends: 4512 [2025-02-05 11:41:11,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:41:11,566 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 705 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3049 mSolverCounterSat, 392 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 3441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 392 IncrementalHoareTripleChecker+Valid, 3049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:11,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 606 Invalid, 3441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [392 Valid, 3049 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:41:11,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4512 states. [2025-02-05 11:41:11,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4512 to 4510. [2025-02-05 11:41:11,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4510 states, 4509 states have (on average 1.4515413617210025) internal successors, (6545), 4509 states have internal predecessors, (6545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:11,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4510 states to 4510 states and 6545 transitions. [2025-02-05 11:41:11,629 INFO L78 Accepts]: Start accepts. Automaton has 4510 states and 6545 transitions. Word has length 115 [2025-02-05 11:41:11,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:11,629 INFO L471 AbstractCegarLoop]: Abstraction has 4510 states and 6545 transitions. [2025-02-05 11:41:11,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 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 11:41:11,629 INFO L276 IsEmpty]: Start isEmpty. Operand 4510 states and 6545 transitions. [2025-02-05 11:41:11,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 11:41:11,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:11,631 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:41:11,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:41:11,631 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:11,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:11,632 INFO L85 PathProgramCache]: Analyzing trace with hash 762552995, now seen corresponding path program 1 times [2025-02-05 11:41:11,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:11,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332737682] [2025-02-05 11:41:11,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:11,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:11,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 11:41:11,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 11:41:11,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:11,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:11,867 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:41:11,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:11,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332737682] [2025-02-05 11:41:11,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332737682] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:11,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:11,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:41:11,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543764489] [2025-02-05 11:41:11,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:11,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:41:11,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:11,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:41:11,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:41:11,869 INFO L87 Difference]: Start difference. First operand 4510 states and 6545 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:15,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:15,367 INFO L93 Difference]: Finished difference Result 14283 states and 20463 transitions. [2025-02-05 11:41:15,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 11:41:15,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2025-02-05 11:41:15,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:15,392 INFO L225 Difference]: With dead ends: 14283 [2025-02-05 11:41:15,392 INFO L226 Difference]: Without dead ends: 9775 [2025-02-05 11:41:15,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:41:15,398 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 2132 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 3777 mSolverCounterSat, 842 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2132 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 4619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 842 IncrementalHoareTripleChecker+Valid, 3777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:15,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2132 Valid, 381 Invalid, 4619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [842 Valid, 3777 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-02-05 11:41:15,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9775 states. [2025-02-05 11:41:15,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9775 to 9767. [2025-02-05 11:41:15,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.3656563587958221) internal successors, (13337), 9766 states have internal predecessors, (13337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:15,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 13337 transitions. [2025-02-05 11:41:15,517 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 13337 transitions. Word has length 160 [2025-02-05 11:41:15,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:15,518 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 13337 transitions. [2025-02-05 11:41:15,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:15,519 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 13337 transitions. [2025-02-05 11:41:15,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 11:41:15,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:15,521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:41:15,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:41:15,522 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:15,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:15,522 INFO L85 PathProgramCache]: Analyzing trace with hash -541700528, now seen corresponding path program 1 times [2025-02-05 11:41:15,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:15,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942924541] [2025-02-05 11:41:15,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:15,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:15,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 11:41:15,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 11:41:15,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:15,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:15,762 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:41:15,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:15,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942924541] [2025-02-05 11:41:15,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942924541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:15,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:15,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:41:15,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4064093] [2025-02-05 11:41:15,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:15,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:41:15,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:15,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:41:15,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:15,763 INFO L87 Difference]: Start difference. First operand 9767 states and 13337 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:18,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:18,410 INFO L93 Difference]: Finished difference Result 25540 states and 35956 transitions. [2025-02-05 11:41:18,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:41:18,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 189 [2025-02-05 11:41:18,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:18,441 INFO L225 Difference]: With dead ends: 25540 [2025-02-05 11:41:18,441 INFO L226 Difference]: Without dead ends: 15775 [2025-02-05 11:41:18,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:18,451 INFO L435 NwaCegarLoop]: 1272 mSDtfsCounter, 734 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2371 mSolverCounterSat, 490 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 2861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 2371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:18,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 1280 Invalid, 2861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 2371 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:41:18,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15775 states. [2025-02-05 11:41:18,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15775 to 15775. [2025-02-05 11:41:18,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15775 states, 15774 states have (on average 1.301572207429948) internal successors, (20531), 15774 states have internal predecessors, (20531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:18,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15775 states to 15775 states and 20531 transitions. [2025-02-05 11:41:18,639 INFO L78 Accepts]: Start accepts. Automaton has 15775 states and 20531 transitions. Word has length 189 [2025-02-05 11:41:18,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:18,640 INFO L471 AbstractCegarLoop]: Abstraction has 15775 states and 20531 transitions. [2025-02-05 11:41:18,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:18,640 INFO L276 IsEmpty]: Start isEmpty. Operand 15775 states and 20531 transitions. [2025-02-05 11:41:18,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-02-05 11:41:18,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:18,643 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:41:18,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:41:18,643 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:18,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:18,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1919703508, now seen corresponding path program 1 times [2025-02-05 11:41:18,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:18,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938364602] [2025-02-05 11:41:18,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:18,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:18,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-02-05 11:41:18,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-02-05 11:41:18,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:18,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:19,001 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-05 11:41:19,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:19,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938364602] [2025-02-05 11:41:19,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938364602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:19,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:19,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:41:19,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055528675] [2025-02-05 11:41:19,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:19,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:41:19,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:19,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:41:19,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:41:19,005 INFO L87 Difference]: Start difference. First operand 15775 states and 20531 transitions. Second operand has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:21,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:21,721 INFO L93 Difference]: Finished difference Result 31587 states and 41098 transitions. [2025-02-05 11:41:21,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:41:21,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 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 256 [2025-02-05 11:41:21,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:21,747 INFO L225 Difference]: With dead ends: 31587 [2025-02-05 11:41:21,747 INFO L226 Difference]: Without dead ends: 15777 [2025-02-05 11:41:21,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:41:21,761 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 850 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3442 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 3701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 3442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:21,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 402 Invalid, 3701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 3442 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:41:21,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15777 states. [2025-02-05 11:41:21,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15777 to 15775. [2025-02-05 11:41:21,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15775 states, 15774 states have (on average 1.2801445416508177) internal successors, (20193), 15774 states have internal predecessors, (20193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:21,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15775 states to 15775 states and 20193 transitions. [2025-02-05 11:41:21,898 INFO L78 Accepts]: Start accepts. Automaton has 15775 states and 20193 transitions. Word has length 256 [2025-02-05 11:41:21,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:21,898 INFO L471 AbstractCegarLoop]: Abstraction has 15775 states and 20193 transitions. [2025-02-05 11:41:21,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:21,899 INFO L276 IsEmpty]: Start isEmpty. Operand 15775 states and 20193 transitions. [2025-02-05 11:41:21,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-02-05 11:41:21,904 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:21,904 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:41:21,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:41:21,904 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:21,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:21,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1910478354, now seen corresponding path program 1 times [2025-02-05 11:41:21,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:21,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417342300] [2025-02-05 11:41:21,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:21,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:21,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-02-05 11:41:21,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-02-05 11:41:21,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:21,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:22,112 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-02-05 11:41:22,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:22,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417342300] [2025-02-05 11:41:22,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417342300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:22,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:22,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:41:22,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884012288] [2025-02-05 11:41:22,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:22,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:41:22,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:22,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:41:22,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:22,113 INFO L87 Difference]: Start difference. First operand 15775 states and 20193 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:24,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:24,395 INFO L93 Difference]: Finished difference Result 44315 states and 57309 transitions. [2025-02-05 11:41:24,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:41:24,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 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 265 [2025-02-05 11:41:24,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:24,444 INFO L225 Difference]: With dead ends: 44315 [2025-02-05 11:41:24,444 INFO L226 Difference]: Without dead ends: 28542 [2025-02-05 11:41:24,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:24,460 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 652 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2001 mSolverCounterSat, 815 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 2816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 815 IncrementalHoareTripleChecker+Valid, 2001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:24,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 524 Invalid, 2816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [815 Valid, 2001 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 11:41:24,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28542 states. [2025-02-05 11:41:24,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28542 to 23285. [2025-02-05 11:41:24,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23285 states, 23284 states have (on average 1.2308022676516062) internal successors, (28658), 23284 states have internal predecessors, (28658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:24,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23285 states to 23285 states and 28658 transitions. [2025-02-05 11:41:24,792 INFO L78 Accepts]: Start accepts. Automaton has 23285 states and 28658 transitions. Word has length 265 [2025-02-05 11:41:24,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:24,793 INFO L471 AbstractCegarLoop]: Abstraction has 23285 states and 28658 transitions. [2025-02-05 11:41:24,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:24,793 INFO L276 IsEmpty]: Start isEmpty. Operand 23285 states and 28658 transitions. [2025-02-05 11:41:24,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-02-05 11:41:24,796 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:24,797 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:41:24,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:41:24,798 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:24,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:24,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1454166008, now seen corresponding path program 1 times [2025-02-05 11:41:24,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:24,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96216872] [2025-02-05 11:41:24,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:24,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:24,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-02-05 11:41:24,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-02-05 11:41:24,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:24,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:25,156 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-02-05 11:41:25,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:25,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96216872] [2025-02-05 11:41:25,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96216872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:25,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:25,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:41:25,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843203715] [2025-02-05 11:41:25,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:25,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:41:25,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:25,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:41:25,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:25,158 INFO L87 Difference]: Start difference. First operand 23285 states and 28658 transitions. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:27,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:27,705 INFO L93 Difference]: Finished difference Result 60837 states and 75914 transitions. [2025-02-05 11:41:27,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:41:27,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 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 344 [2025-02-05 11:41:27,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:27,763 INFO L225 Difference]: With dead ends: 60837 [2025-02-05 11:41:27,764 INFO L226 Difference]: Without dead ends: 37554 [2025-02-05 11:41:27,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:27,780 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 793 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2166 mSolverCounterSat, 912 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 3078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 912 IncrementalHoareTripleChecker+Valid, 2166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:27,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 105 Invalid, 3078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [912 Valid, 2166 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 11:41:27,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37554 states. [2025-02-05 11:41:28,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37554 to 34550. [2025-02-05 11:41:28,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34550 states, 34549 states have (on average 1.2429013864366552) internal successors, (42941), 34549 states have internal predecessors, (42941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:28,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34550 states to 34550 states and 42941 transitions. [2025-02-05 11:41:28,126 INFO L78 Accepts]: Start accepts. Automaton has 34550 states and 42941 transitions. Word has length 344 [2025-02-05 11:41:28,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:28,128 INFO L471 AbstractCegarLoop]: Abstraction has 34550 states and 42941 transitions. [2025-02-05 11:41:28,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:28,128 INFO L276 IsEmpty]: Start isEmpty. Operand 34550 states and 42941 transitions. [2025-02-05 11:41:28,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-02-05 11:41:28,131 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:28,132 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:41:28,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:41:28,132 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:28,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:28,132 INFO L85 PathProgramCache]: Analyzing trace with hash 249239533, now seen corresponding path program 1 times [2025-02-05 11:41:28,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:28,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945023787] [2025-02-05 11:41:28,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:28,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:28,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-02-05 11:41:28,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-02-05 11:41:28,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:28,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:28,496 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-02-05 11:41:28,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:28,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945023787] [2025-02-05 11:41:28,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945023787] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:28,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:28,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:41:28,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548276874] [2025-02-05 11:41:28,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:28,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:41:28,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:28,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:41:28,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:28,497 INFO L87 Difference]: Start difference. First operand 34550 states and 42941 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:31,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:31,048 INFO L93 Difference]: Finished difference Result 78110 states and 97615 transitions. [2025-02-05 11:41:31,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:41:31,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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 361 [2025-02-05 11:41:31,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:31,095 INFO L225 Difference]: With dead ends: 78110 [2025-02-05 11:41:31,095 INFO L226 Difference]: Without dead ends: 43562 [2025-02-05 11:41:31,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:31,121 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 797 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2029 mSolverCounterSat, 977 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 3006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 977 IncrementalHoareTripleChecker+Valid, 2029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:31,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 147 Invalid, 3006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [977 Valid, 2029 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 11:41:31,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43562 states. [2025-02-05 11:41:31,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43562 to 43562. [2025-02-05 11:41:31,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43562 states, 43561 states have (on average 1.2146185808406602) internal successors, (52910), 43561 states have internal predecessors, (52910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:31,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43562 states to 43562 states and 52910 transitions. [2025-02-05 11:41:31,448 INFO L78 Accepts]: Start accepts. Automaton has 43562 states and 52910 transitions. Word has length 361 [2025-02-05 11:41:31,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:31,449 INFO L471 AbstractCegarLoop]: Abstraction has 43562 states and 52910 transitions. [2025-02-05 11:41:31,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:31,449 INFO L276 IsEmpty]: Start isEmpty. Operand 43562 states and 52910 transitions. [2025-02-05 11:41:31,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-02-05 11:41:31,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:31,452 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:41:31,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:41:31,452 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:31,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:31,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1449233394, now seen corresponding path program 1 times [2025-02-05 11:41:31,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:31,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546572419] [2025-02-05 11:41:31,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:31,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:31,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-02-05 11:41:31,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-02-05 11:41:31,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:31,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:31,919 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 101 proven. 24 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-05 11:41:31,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:31,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546572419] [2025-02-05 11:41:31,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546572419] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:41:31,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229611968] [2025-02-05 11:41:31,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:31,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:41:31,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:41:31,923 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:41:31,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 11:41:31,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-02-05 11:41:32,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-02-05 11:41:32,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:32,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:32,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:41:32,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:41:32,132 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-05 11:41:32,132 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:41:32,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229611968] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:32,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:41:32,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:41:32,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816994019] [2025-02-05 11:41:32,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:32,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:41:32,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:32,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:41:32,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:41:32,134 INFO L87 Difference]: Start difference. First operand 43562 states and 52910 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:34,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:34,236 INFO L93 Difference]: Finished difference Result 94632 states and 114283 transitions. [2025-02-05 11:41:34,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:41:34,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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 372 [2025-02-05 11:41:34,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:34,307 INFO L225 Difference]: With dead ends: 94632 [2025-02-05 11:41:34,307 INFO L226 Difference]: Without dead ends: 48068 [2025-02-05 11:41:34,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:41:34,336 INFO L435 NwaCegarLoop]: 1392 mSDtfsCounter, 710 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2005 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 2389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 2005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:34,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 1400 Invalid, 2389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 2005 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 11:41:34,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48068 states. [2025-02-05 11:41:34,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48068 to 48068. [2025-02-05 11:41:34,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48068 states, 48067 states have (on average 1.1855326939480308) internal successors, (56985), 48067 states have internal predecessors, (56985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:34,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48068 states to 48068 states and 56985 transitions. [2025-02-05 11:41:34,918 INFO L78 Accepts]: Start accepts. Automaton has 48068 states and 56985 transitions. Word has length 372 [2025-02-05 11:41:34,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:34,918 INFO L471 AbstractCegarLoop]: Abstraction has 48068 states and 56985 transitions. [2025-02-05 11:41:34,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:34,918 INFO L276 IsEmpty]: Start isEmpty. Operand 48068 states and 56985 transitions. [2025-02-05 11:41:34,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-02-05 11:41:34,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:34,922 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:41:34,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 11:41:35,127 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 11:41:35,127 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:35,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:35,127 INFO L85 PathProgramCache]: Analyzing trace with hash 429183350, now seen corresponding path program 1 times [2025-02-05 11:41:35,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:35,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467809452] [2025-02-05 11:41:35,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:35,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:35,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-02-05 11:41:35,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-02-05 11:41:35,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:35,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:35,260 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 466 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-02-05 11:41:35,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:35,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467809452] [2025-02-05 11:41:35,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467809452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:35,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:35,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:41:35,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754923752] [2025-02-05 11:41:35,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:35,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:41:35,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:35,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:41:35,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:35,262 INFO L87 Difference]: Start difference. First operand 48068 states and 56985 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:38,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:38,182 INFO L93 Difference]: Finished difference Result 120917 states and 143008 transitions. [2025-02-05 11:41:38,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:41:38,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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 403 [2025-02-05 11:41:38,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:38,258 INFO L225 Difference]: With dead ends: 120917 [2025-02-05 11:41:38,259 INFO L226 Difference]: Without dead ends: 72851 [2025-02-05 11:41:38,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:38,296 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 733 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2222 mSolverCounterSat, 728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 2950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 728 IncrementalHoareTripleChecker+Valid, 2222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:38,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 170 Invalid, 2950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [728 Valid, 2222 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:41:38,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72851 states. [2025-02-05 11:41:38,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72851 to 69096. [2025-02-05 11:41:38,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69096 states, 69095 states have (on average 1.1746580794558217) internal successors, (81163), 69095 states have internal predecessors, (81163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:38,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69096 states to 69096 states and 81163 transitions. [2025-02-05 11:41:38,995 INFO L78 Accepts]: Start accepts. Automaton has 69096 states and 81163 transitions. Word has length 403 [2025-02-05 11:41:38,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:38,996 INFO L471 AbstractCegarLoop]: Abstraction has 69096 states and 81163 transitions. [2025-02-05 11:41:38,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:38,997 INFO L276 IsEmpty]: Start isEmpty. Operand 69096 states and 81163 transitions. [2025-02-05 11:41:39,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-02-05 11:41:39,000 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:39,001 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:41:39,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:41:39,001 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:39,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:39,001 INFO L85 PathProgramCache]: Analyzing trace with hash -283442712, now seen corresponding path program 1 times [2025-02-05 11:41:39,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:39,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155363285] [2025-02-05 11:41:39,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:39,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:39,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-02-05 11:41:39,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-02-05 11:41:39,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:39,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:39,127 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 466 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-02-05 11:41:39,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:39,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155363285] [2025-02-05 11:41:39,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155363285] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:39,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:39,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:41:39,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520914095] [2025-02-05 11:41:39,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:39,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:41:39,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:39,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:41:39,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:39,129 INFO L87 Difference]: Start difference. First operand 69096 states and 81163 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:41,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:41,815 INFO L93 Difference]: Finished difference Result 168981 states and 198076 transitions. [2025-02-05 11:41:41,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:41:41,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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 423 [2025-02-05 11:41:41,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:41,927 INFO L225 Difference]: With dead ends: 168981 [2025-02-05 11:41:41,927 INFO L226 Difference]: Without dead ends: 99136 [2025-02-05 11:41:41,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:41,976 INFO L435 NwaCegarLoop]: 1039 mSDtfsCounter, 798 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2069 mSolverCounterSat, 633 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 2702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 633 IncrementalHoareTripleChecker+Valid, 2069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:41,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 1047 Invalid, 2702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [633 Valid, 2069 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 11:41:42,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99136 states. [2025-02-05 11:41:42,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99136 to 85618. [2025-02-05 11:41:42,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85618 states, 85617 states have (on average 1.1317845754931848) internal successors, (96900), 85617 states have internal predecessors, (96900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:42,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85618 states to 85618 states and 96900 transitions. [2025-02-05 11:41:42,975 INFO L78 Accepts]: Start accepts. Automaton has 85618 states and 96900 transitions. Word has length 423 [2025-02-05 11:41:42,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:42,975 INFO L471 AbstractCegarLoop]: Abstraction has 85618 states and 96900 transitions. [2025-02-05 11:41:42,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:42,975 INFO L276 IsEmpty]: Start isEmpty. Operand 85618 states and 96900 transitions. [2025-02-05 11:41:42,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-02-05 11:41:42,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:42,979 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:41:42,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:41:42,980 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:42,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:42,980 INFO L85 PathProgramCache]: Analyzing trace with hash 267090504, now seen corresponding path program 1 times [2025-02-05 11:41:42,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:42,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472034603] [2025-02-05 11:41:42,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:42,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:43,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-02-05 11:41:43,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-02-05 11:41:43,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:43,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 337 proven. 14 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-02-05 11:41:43,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:43,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472034603] [2025-02-05 11:41:43,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472034603] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:41:43,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033308937] [2025-02-05 11:41:43,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:43,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:41:43,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:41:43,377 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:41:43,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 11:41:43,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-02-05 11:41:43,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-02-05 11:41:43,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:43,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:43,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:41:43,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:41:43,581 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-02-05 11:41:43,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:41:43,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033308937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:43,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:41:43,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:41:43,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595239224] [2025-02-05 11:41:43,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:43,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:41:43,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:43,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:41:43,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:41:43,583 INFO L87 Difference]: Start difference. First operand 85618 states and 96900 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:46,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:46,409 INFO L93 Difference]: Finished difference Result 170483 states and 193042 transitions. [2025-02-05 11:41:46,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:41:46,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 427 [2025-02-05 11:41:46,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:46,501 INFO L225 Difference]: With dead ends: 170483 [2025-02-05 11:41:46,501 INFO L226 Difference]: Without dead ends: 85618 [2025-02-05 11:41:46,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:41:46,529 INFO L435 NwaCegarLoop]: 1270 mSDtfsCounter, 747 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2058 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 2537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 2058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:46,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 1278 Invalid, 2537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 2058 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 11:41:46,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85618 states. [2025-02-05 11:41:47,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85618 to 75855. [2025-02-05 11:41:47,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75855 states, 75854 states have (on average 1.1084583542067656) internal successors, (84081), 75854 states have internal predecessors, (84081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:47,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75855 states to 75855 states and 84081 transitions. [2025-02-05 11:41:47,475 INFO L78 Accepts]: Start accepts. Automaton has 75855 states and 84081 transitions. Word has length 427 [2025-02-05 11:41:47,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:47,477 INFO L471 AbstractCegarLoop]: Abstraction has 75855 states and 84081 transitions. [2025-02-05 11:41:47,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:47,477 INFO L276 IsEmpty]: Start isEmpty. Operand 75855 states and 84081 transitions. [2025-02-05 11:41:47,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-02-05 11:41:47,484 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:47,484 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:41:47,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 11:41:47,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:41:47,685 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:47,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:47,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1736031296, now seen corresponding path program 1 times [2025-02-05 11:41:47,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:47,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751817184] [2025-02-05 11:41:47,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:47,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:47,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-02-05 11:41:47,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-02-05 11:41:47,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:47,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:48,057 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 509 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-02-05 11:41:48,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:48,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751817184] [2025-02-05 11:41:48,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751817184] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:48,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:48,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:41:48,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626348978] [2025-02-05 11:41:48,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:48,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:41:48,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:48,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:41:48,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:48,060 INFO L87 Difference]: Start difference. First operand 75855 states and 84081 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:50,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:50,441 INFO L93 Difference]: Finished difference Result 171985 states and 189506 transitions. [2025-02-05 11:41:50,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:41:50,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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 456 [2025-02-05 11:41:50,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:50,557 INFO L225 Difference]: With dead ends: 171985 [2025-02-05 11:41:50,557 INFO L226 Difference]: Without dead ends: 96883 [2025-02-05 11:41:50,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:50,605 INFO L435 NwaCegarLoop]: 1222 mSDtfsCounter, 653 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2550 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 2835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 2550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:50,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 1230 Invalid, 2835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 2550 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 11:41:50,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96883 states. [2025-02-05 11:41:51,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96883 to 92377. [2025-02-05 11:41:51,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92377 states, 92376 states have (on average 1.0921776218931325) internal successors, (100891), 92376 states have internal predecessors, (100891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:51,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92377 states to 92377 states and 100891 transitions. [2025-02-05 11:41:51,490 INFO L78 Accepts]: Start accepts. Automaton has 92377 states and 100891 transitions. Word has length 456 [2025-02-05 11:41:51,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:51,490 INFO L471 AbstractCegarLoop]: Abstraction has 92377 states and 100891 transitions. [2025-02-05 11:41:51,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:51,490 INFO L276 IsEmpty]: Start isEmpty. Operand 92377 states and 100891 transitions. [2025-02-05 11:41:51,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2025-02-05 11:41:51,653 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:51,653 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:41:51,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 11:41:51,654 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:51,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:51,654 INFO L85 PathProgramCache]: Analyzing trace with hash 690086528, now seen corresponding path program 1 times [2025-02-05 11:41:51,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:51,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092166690] [2025-02-05 11:41:51,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:51,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:51,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-02-05 11:41:51,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-02-05 11:41:51,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:51,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:52,305 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 575 proven. 14 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-02-05 11:41:52,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:52,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092166690] [2025-02-05 11:41:52,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092166690] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:41:52,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854031592] [2025-02-05 11:41:52,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:52,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:41:52,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:41:52,309 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:41:52,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 11:41:52,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-02-05 11:41:52,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-02-05 11:41:52,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:52,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:52,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:41:52,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:41:52,566 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-02-05 11:41:52,568 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:41:52,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854031592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:52,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:41:52,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:41:52,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855395549] [2025-02-05 11:41:52,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:52,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:41:52,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:52,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:41:52,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:41:52,570 INFO L87 Difference]: Start difference. First operand 92377 states and 100891 transitions. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:54,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:54,994 INFO L93 Difference]: Finished difference Result 184001 states and 201024 transitions. [2025-02-05 11:41:54,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:41:54,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 507 [2025-02-05 11:41:54,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:55,103 INFO L225 Difference]: With dead ends: 184001 [2025-02-05 11:41:55,103 INFO L226 Difference]: Without dead ends: 92377 [2025-02-05 11:41:55,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 506 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:41:55,157 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 737 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2172 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 2495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 2172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:55,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 383 Invalid, 2495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 2172 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 11:41:55,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92377 states. [2025-02-05 11:41:56,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92377 to 89373. [2025-02-05 11:41:56,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89373 states, 89372 states have (on average 1.0771046860314193) internal successors, (96263), 89372 states have internal predecessors, (96263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:56,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89373 states to 89373 states and 96263 transitions. [2025-02-05 11:41:56,238 INFO L78 Accepts]: Start accepts. Automaton has 89373 states and 96263 transitions. Word has length 507 [2025-02-05 11:41:56,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:41:56,239 INFO L471 AbstractCegarLoop]: Abstraction has 89373 states and 96263 transitions. [2025-02-05 11:41:56,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:56,239 INFO L276 IsEmpty]: Start isEmpty. Operand 89373 states and 96263 transitions. [2025-02-05 11:41:56,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2025-02-05 11:41:56,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:41:56,248 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:41:56,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 11:41:56,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:41:56,449 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:41:56,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:41:56,449 INFO L85 PathProgramCache]: Analyzing trace with hash -368144942, now seen corresponding path program 1 times [2025-02-05 11:41:56,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:41:56,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484093538] [2025-02-05 11:41:56,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:41:56,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:41:56,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 508 statements into 1 equivalence classes. [2025-02-05 11:41:56,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 508 of 508 statements. [2025-02-05 11:41:56,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:41:56,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:41:56,746 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-02-05 11:41:56,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:41:56,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484093538] [2025-02-05 11:41:56,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484093538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:41:56,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:41:56,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:41:56,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719455117] [2025-02-05 11:41:56,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:41:56,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:41:56,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:41:56,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:41:56,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:56,749 INFO L87 Difference]: Start difference. First operand 89373 states and 96263 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:41:59,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:41:59,347 INFO L93 Difference]: Finished difference Result 177993 states and 191768 transitions. [2025-02-05 11:41:59,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:41:59,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 508 [2025-02-05 11:41:59,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:41:59,444 INFO L225 Difference]: With dead ends: 177993 [2025-02-05 11:41:59,444 INFO L226 Difference]: Without dead ends: 89373 [2025-02-05 11:41:59,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:41:59,497 INFO L435 NwaCegarLoop]: 1201 mSDtfsCounter, 729 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2227 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 2510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 2227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:41:59,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 1209 Invalid, 2510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 2227 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 11:41:59,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89373 states. [2025-02-05 11:42:00,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89373 to 88622. [2025-02-05 11:42:00,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88622 states, 88621 states have (on average 1.065650353753625) internal successors, (94439), 88621 states have internal predecessors, (94439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88622 states to 88622 states and 94439 transitions. [2025-02-05 11:42:00,369 INFO L78 Accepts]: Start accepts. Automaton has 88622 states and 94439 transitions. Word has length 508 [2025-02-05 11:42:00,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:42:00,370 INFO L471 AbstractCegarLoop]: Abstraction has 88622 states and 94439 transitions. [2025-02-05 11:42:00,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:00,370 INFO L276 IsEmpty]: Start isEmpty. Operand 88622 states and 94439 transitions. [2025-02-05 11:42:00,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2025-02-05 11:42:00,376 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:42:00,377 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:42:00,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 11:42:00,378 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:42:00,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:42:00,378 INFO L85 PathProgramCache]: Analyzing trace with hash 501362809, now seen corresponding path program 1 times [2025-02-05 11:42:00,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:42:00,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096386986] [2025-02-05 11:42:00,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:00,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:42:00,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-02-05 11:42:00,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-02-05 11:42:00,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:00,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:00,592 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2025-02-05 11:42:00,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:42:00,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096386986] [2025-02-05 11:42:00,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096386986] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:42:00,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:42:00,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:42:00,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436943870] [2025-02-05 11:42:00,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:42:00,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:42:00,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:42:00,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:42:00,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:42:00,594 INFO L87 Difference]: Start difference. First operand 88622 states and 94439 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:03,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:42:03,141 INFO L93 Difference]: Finished difference Result 221551 states and 237108 transitions. [2025-02-05 11:42:03,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:42:03,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 528 [2025-02-05 11:42:03,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:42:03,282 INFO L225 Difference]: With dead ends: 221551 [2025-02-05 11:42:03,282 INFO L226 Difference]: Without dead ends: 133682 [2025-02-05 11:42:03,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:42:03,315 INFO L435 NwaCegarLoop]: 1188 mSDtfsCounter, 756 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2345 mSolverCounterSat, 502 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 2847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 502 IncrementalHoareTripleChecker+Valid, 2345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:42:03,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 1196 Invalid, 2847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [502 Valid, 2345 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 11:42:03,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133682 states. [2025-02-05 11:42:04,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133682 to 129927. [2025-02-05 11:42:04,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129927 states, 129926 states have (on average 1.0635515601188368) internal successors, (138183), 129926 states have internal predecessors, (138183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:04,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129927 states to 129927 states and 138183 transitions. [2025-02-05 11:42:04,590 INFO L78 Accepts]: Start accepts. Automaton has 129927 states and 138183 transitions. Word has length 528 [2025-02-05 11:42:04,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:42:04,590 INFO L471 AbstractCegarLoop]: Abstraction has 129927 states and 138183 transitions. [2025-02-05 11:42:04,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:04,590 INFO L276 IsEmpty]: Start isEmpty. Operand 129927 states and 138183 transitions. [2025-02-05 11:42:04,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-02-05 11:42:04,601 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:42:04,601 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:42:04,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 11:42:04,602 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:42:04,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:42:04,602 INFO L85 PathProgramCache]: Analyzing trace with hash 155162781, now seen corresponding path program 1 times [2025-02-05 11:42:04,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:42:04,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594482086] [2025-02-05 11:42:04,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:04,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:42:04,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-02-05 11:42:04,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-02-05 11:42:04,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:04,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:04,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1097 backedges. 802 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-02-05 11:42:04,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:42:04,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594482086] [2025-02-05 11:42:04,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594482086] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:42:04,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:42:04,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:42:04,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174680598] [2025-02-05 11:42:04,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:42:04,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:42:04,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:42:04,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:42:04,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:42:04,820 INFO L87 Difference]: Start difference. First operand 129927 states and 138183 transitions. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:07,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:42:07,568 INFO L93 Difference]: Finished difference Result 259852 states and 276362 transitions. [2025-02-05 11:42:07,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:42:07,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 597 [2025-02-05 11:42:07,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:42:07,747 INFO L225 Difference]: With dead ends: 259852 [2025-02-05 11:42:07,748 INFO L226 Difference]: Without dead ends: 129927 [2025-02-05 11:42:07,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:42:07,799 INFO L435 NwaCegarLoop]: 1198 mSDtfsCounter, 670 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2118 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 2431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 2118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:42:07,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 1206 Invalid, 2431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 2118 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 11:42:07,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129927 states. [2025-02-05 11:42:08,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129927 to 120915. [2025-02-05 11:42:09,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120915 states, 120914 states have (on average 1.0504656201928644) internal successors, (127016), 120914 states have internal predecessors, (127016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120915 states to 120915 states and 127016 transitions. [2025-02-05 11:42:09,181 INFO L78 Accepts]: Start accepts. Automaton has 120915 states and 127016 transitions. Word has length 597 [2025-02-05 11:42:09,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:42:09,181 INFO L471 AbstractCegarLoop]: Abstraction has 120915 states and 127016 transitions. [2025-02-05 11:42:09,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:09,182 INFO L276 IsEmpty]: Start isEmpty. Operand 120915 states and 127016 transitions. [2025-02-05 11:42:09,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2025-02-05 11:42:09,201 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:42:09,201 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:42:09,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 11:42:09,201 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:42:09,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:42:09,203 INFO L85 PathProgramCache]: Analyzing trace with hash 42274259, now seen corresponding path program 1 times [2025-02-05 11:42:09,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:42:09,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414319931] [2025-02-05 11:42:09,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:09,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:42:09,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 645 statements into 1 equivalence classes. [2025-02-05 11:42:09,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 645 of 645 statements. [2025-02-05 11:42:09,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:09,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:09,671 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 704 trivial. 0 not checked. [2025-02-05 11:42:09,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:42:09,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414319931] [2025-02-05 11:42:09,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414319931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:42:09,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:42:09,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:42:09,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530948326] [2025-02-05 11:42:09,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:42:09,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:42:09,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:42:09,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:42:09,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:42:09,673 INFO L87 Difference]: Start difference. First operand 120915 states and 127016 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:12,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:42:12,418 INFO L93 Difference]: Finished difference Result 283133 states and 298292 transitions. [2025-02-05 11:42:12,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:42:12,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 645 [2025-02-05 11:42:12,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:42:12,627 INFO L225 Difference]: With dead ends: 283133 [2025-02-05 11:42:12,627 INFO L226 Difference]: Without dead ends: 162971 [2025-02-05 11:42:12,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:42:12,713 INFO L435 NwaCegarLoop]: 1109 mSDtfsCounter, 772 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:42:12,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1117 Invalid, 2902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 11:42:12,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162971 states. [2025-02-05 11:42:14,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162971 to 157714. [2025-02-05 11:42:14,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157714 states, 157713 states have (on average 1.0542060578392396) internal successors, (166262), 157713 states have internal predecessors, (166262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:14,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157714 states to 157714 states and 166262 transitions. [2025-02-05 11:42:14,764 INFO L78 Accepts]: Start accepts. Automaton has 157714 states and 166262 transitions. Word has length 645 [2025-02-05 11:42:14,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:42:14,764 INFO L471 AbstractCegarLoop]: Abstraction has 157714 states and 166262 transitions. [2025-02-05 11:42:14,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:14,765 INFO L276 IsEmpty]: Start isEmpty. Operand 157714 states and 166262 transitions. [2025-02-05 11:42:14,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-02-05 11:42:14,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:42:14,790 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:42:14,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 11:42:14,790 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:42:14,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:42:14,790 INFO L85 PathProgramCache]: Analyzing trace with hash 510745712, now seen corresponding path program 1 times [2025-02-05 11:42:14,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:42:14,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354416871] [2025-02-05 11:42:14,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:14,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:42:15,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-02-05 11:42:15,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-02-05 11:42:15,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:15,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:15,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1185 backedges. 846 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-02-05 11:42:15,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:42:15,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354416871] [2025-02-05 11:42:15,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354416871] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:42:15,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:42:15,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:42:15,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983456357] [2025-02-05 11:42:15,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:42:15,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:42:15,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:42:15,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:42:15,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:42:15,332 INFO L87 Difference]: Start difference. First operand 157714 states and 166262 transitions. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:17,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:42:17,799 INFO L93 Difference]: Finished difference Result 314675 states and 331766 transitions. [2025-02-05 11:42:17,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:42:17,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 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 680 [2025-02-05 11:42:17,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:42:17,959 INFO L225 Difference]: With dead ends: 314675 [2025-02-05 11:42:17,959 INFO L226 Difference]: Without dead ends: 157714 [2025-02-05 11:42:18,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:42:18,048 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 653 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2094 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 2292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 2094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:42:18,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 488 Invalid, 2292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 2094 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 11:42:18,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157714 states. [2025-02-05 11:42:19,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157714 to 156963. [2025-02-05 11:42:19,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156963 states, 156962 states have (on average 1.051133395344096) internal successors, (164988), 156962 states have internal predecessors, (164988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:19,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156963 states to 156963 states and 164988 transitions. [2025-02-05 11:42:19,988 INFO L78 Accepts]: Start accepts. Automaton has 156963 states and 164988 transitions. Word has length 680 [2025-02-05 11:42:19,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:42:19,989 INFO L471 AbstractCegarLoop]: Abstraction has 156963 states and 164988 transitions. [2025-02-05 11:42:19,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:19,989 INFO L276 IsEmpty]: Start isEmpty. Operand 156963 states and 164988 transitions. [2025-02-05 11:42:20,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2025-02-05 11:42:20,011 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:42:20,011 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:42:20,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 11:42:20,011 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:42:20,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:42:20,012 INFO L85 PathProgramCache]: Analyzing trace with hash 683189862, now seen corresponding path program 1 times [2025-02-05 11:42:20,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:42:20,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103733360] [2025-02-05 11:42:20,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:42:20,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:42:20,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 684 statements into 1 equivalence classes. [2025-02-05 11:42:20,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 684 of 684 statements. [2025-02-05 11:42:20,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:42:20,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:42:20,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 984 proven. 0 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2025-02-05 11:42:20,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:42:20,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103733360] [2025-02-05 11:42:20,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103733360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:42:20,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:42:20,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:42:20,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465473574] [2025-02-05 11:42:20,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:42:20,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:42:20,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:42:20,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:42:20,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:42:20,677 INFO L87 Difference]: Start difference. First operand 156963 states and 164988 transitions. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:42:23,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:42:23,954 INFO L93 Difference]: Finished difference Result 344717 states and 362821 transitions. [2025-02-05 11:42:23,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:42:23,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 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 684 [2025-02-05 11:42:23,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:42:24,173 INFO L225 Difference]: With dead ends: 344717 [2025-02-05 11:42:24,174 INFO L226 Difference]: Without dead ends: 188507 [2025-02-05 11:42:24,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:42:24,284 INFO L435 NwaCegarLoop]: 1298 mSDtfsCounter, 612 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2286 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 2795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 2286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:42:24,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 1306 Invalid, 2795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 2286 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:42:24,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188507 states.