./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label58.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label58.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 80e930446c3b5aed0357903e7f6687fdab832b55b1199711672275ec34cd4ed8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 11:02:57,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:02:57,340 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 11:02:57,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:02:57,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:02:57,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:02:57,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:02:57,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:02:57,362 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:02:57,362 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:02:57,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:02:57,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:02:57,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:02:57,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:02:57,363 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:02:57,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:02:57,364 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:02:57,364 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:02:57,364 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 11:02:57,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:02:57,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:02:57,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:02:57,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:02:57,364 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:02:57,364 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:02:57,364 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:02:57,364 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:02:57,364 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:02:57,364 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:02:57,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:02:57,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:02:57,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:02:57,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:02:57,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:02:57,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:02:57,365 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:02:57,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:02:57,365 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 11:02:57,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 11:02:57,365 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:02:57,365 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:02:57,365 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:02:57,365 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:02:57,365 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/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 -> 80e930446c3b5aed0357903e7f6687fdab832b55b1199711672275ec34cd4ed8 [2025-03-03 11:02:57,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:02:57,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:02:57,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:02:57,582 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:02:57,583 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:02:57,583 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label58.c [2025-03-03 11:02:58,666 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/575a43e67/4f47257089564be694f50a86bce05e50/FLAG0d4f368ca [2025-03-03 11:02:59,120 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:02:59,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label58.c [2025-03-03 11:02:59,144 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/575a43e67/4f47257089564be694f50a86bce05e50/FLAG0d4f368ca [2025-03-03 11:02:59,239 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/575a43e67/4f47257089564be694f50a86bce05e50 [2025-03-03 11:02:59,241 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:02:59,242 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:02:59,243 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:02:59,243 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:02:59,246 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:02:59,247 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:02:59" (1/1) ... [2025-03-03 11:02:59,248 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ef33c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:59, skipping insertion in model container [2025-03-03 11:02:59,249 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:02:59" (1/1) ... [2025-03-03 11:02:59,304 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:02:59,438 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label58.c[6741,6754] [2025-03-03 11:02:59,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:02:59,744 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:02:59,762 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label58.c[6741,6754] [2025-03-03 11:02:59,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:02:59,962 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:02:59,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:59 WrapperNode [2025-03-03 11:02:59,963 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:02:59,964 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:02:59,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:02:59,964 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:02:59,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:59" (1/1) ... [2025-03-03 11:03:00,011 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:59" (1/1) ... [2025-03-03 11:03:00,208 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-03 11:03:00,209 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:03:00,209 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:03:00,209 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:03:00,209 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:03:00,216 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:59" (1/1) ... [2025-03-03 11:03:00,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:59" (1/1) ... [2025-03-03 11:03:00,253 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:59" (1/1) ... [2025-03-03 11:03:00,368 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-03-03 11:03:00,368 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:59" (1/1) ... [2025-03-03 11:03:00,368 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:59" (1/1) ... [2025-03-03 11:03:00,415 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:59" (1/1) ... [2025-03-03 11:03:00,426 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:59" (1/1) ... [2025-03-03 11:03:00,441 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:59" (1/1) ... [2025-03-03 11:03:00,453 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:59" (1/1) ... [2025-03-03 11:03:00,487 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:03:00,488 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:03:00,488 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:03:00,489 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:03:00,489 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:59" (1/1) ... [2025-03-03 11:03:00,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:03:00,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:03:00,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 11:03:00,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 11:03:00,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:03:00,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 11:03:00,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:03:00,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:03:00,581 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:03:00,582 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:03:03,177 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-03 11:03:03,269 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-03 11:03:03,269 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:03:03,294 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:03:03,294 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:03:03,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:03:03 BoogieIcfgContainer [2025-03-03 11:03:03,300 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:03:03,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:03:03,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:03:03,305 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:03:03,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:02:59" (1/3) ... [2025-03-03 11:03:03,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5baf532b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:03:03, skipping insertion in model container [2025-03-03 11:03:03,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:02:59" (2/3) ... [2025-03-03 11:03:03,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5baf532b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:03:03, skipping insertion in model container [2025-03-03 11:03:03,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:03:03" (3/3) ... [2025-03-03 11:03:03,308 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label58.c [2025-03-03 11:03:03,319 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:03:03,320 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label58.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 11:03:03,373 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:03:03,383 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;@b40c4d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:03:03,383 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 11:03:03,388 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:03,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 11:03:03,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:03,395 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:03,395 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:03,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:03,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1280947699, now seen corresponding path program 1 times [2025-03-03 11:03:03,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:03,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613628228] [2025-03-03 11:03:03,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:03,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:03,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 11:03:03,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 11:03:03,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:03,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:03,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:03:03,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:03,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613628228] [2025-03-03 11:03:03,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613628228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:03,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:03,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:03:03,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589056539] [2025-03-03 11:03:03,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:03,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:03,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:03,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:03,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:03,718 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:05,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:05,863 INFO L93 Difference]: Finished difference Result 1667 states and 3058 transitions. [2025-03-03 11:03:05,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:05,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-03 11:03:05,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:05,876 INFO L225 Difference]: With dead ends: 1667 [2025-03-03 11:03:05,876 INFO L226 Difference]: Without dead ends: 998 [2025-03-03 11:03:05,880 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-03-03 11:03:05,883 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 500 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:05,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 276 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 11:03:05,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2025-03-03 11:03:05,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 982. [2025-03-03 11:03:05,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 1.707441386340469) internal successors, (1675), 981 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:05,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1675 transitions. [2025-03-03 11:03:05,986 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1675 transitions. Word has length 45 [2025-03-03 11:03:05,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:05,986 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1675 transitions. [2025-03-03 11:03:05,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:05,990 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1675 transitions. [2025-03-03 11:03:05,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 11:03:05,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:05,995 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-03-03 11:03:05,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 11:03:05,995 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:05,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:05,996 INFO L85 PathProgramCache]: Analyzing trace with hash 209969005, now seen corresponding path program 1 times [2025-03-03 11:03:05,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:05,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552243915] [2025-03-03 11:03:05,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:05,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:06,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 11:03:06,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 11:03:06,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:06,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:06,307 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:03:06,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:06,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552243915] [2025-03-03 11:03:06,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552243915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:06,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:06,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:03:06,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224486984] [2025-03-03 11:03:06,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:06,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:06,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:06,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:06,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:06,312 INFO L87 Difference]: Start difference. First operand 982 states and 1675 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:07,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:07,959 INFO L93 Difference]: Finished difference Result 2824 states and 4847 transitions. [2025-03-03 11:03:07,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:07,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-03-03 11:03:07,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:07,966 INFO L225 Difference]: With dead ends: 2824 [2025-03-03 11:03:07,966 INFO L226 Difference]: Without dead ends: 1844 [2025-03-03 11:03:07,968 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-03-03 11:03:07,969 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 393 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:07,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 11:03:07,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-03-03 11:03:07,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1844. [2025-03-03 11:03:07,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1843 states have (on average 1.3836136733586544) internal successors, (2550), 1843 states have internal predecessors, (2550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:08,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 2550 transitions. [2025-03-03 11:03:08,004 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 2550 transitions. Word has length 110 [2025-03-03 11:03:08,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:08,005 INFO L471 AbstractCegarLoop]: Abstraction has 1844 states and 2550 transitions. [2025-03-03 11:03:08,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:08,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2550 transitions. [2025-03-03 11:03:08,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-03 11:03:08,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:08,010 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 11:03:08,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 11:03:08,011 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:08,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:08,014 INFO L85 PathProgramCache]: Analyzing trace with hash 303281924, now seen corresponding path program 1 times [2025-03-03 11:03:08,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:08,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825926047] [2025-03-03 11:03:08,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:08,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:08,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-03 11:03:08,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-03 11:03:08,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:08,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:08,305 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:03:08,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:08,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825926047] [2025-03-03 11:03:08,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825926047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:08,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:08,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:08,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094596252] [2025-03-03 11:03:08,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:08,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:08,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:08,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:08,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:08,307 INFO L87 Difference]: Start difference. First operand 1844 states and 2550 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:09,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:09,955 INFO L93 Difference]: Finished difference Result 4546 states and 6595 transitions. [2025-03-03 11:03:09,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:09,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 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 193 [2025-03-03 11:03:09,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:09,965 INFO L225 Difference]: With dead ends: 4546 [2025-03-03 11:03:09,966 INFO L226 Difference]: Without dead ends: 2704 [2025-03-03 11:03:09,971 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-03-03 11:03:09,972 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 500 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:09,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 817 Invalid, 1633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 11:03:09,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2025-03-03 11:03:10,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2704. [2025-03-03 11:03:10,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2704 states, 2703 states have (on average 1.38771735109138) internal successors, (3751), 2703 states have internal predecessors, (3751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:10,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 3751 transitions. [2025-03-03 11:03:10,020 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 3751 transitions. Word has length 193 [2025-03-03 11:03:10,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:10,021 INFO L471 AbstractCegarLoop]: Abstraction has 2704 states and 3751 transitions. [2025-03-03 11:03:10,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:10,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 3751 transitions. [2025-03-03 11:03:10,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-03 11:03:10,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:10,023 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:10,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 11:03:10,023 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:10,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:10,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1095746899, now seen corresponding path program 1 times [2025-03-03 11:03:10,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:10,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371405096] [2025-03-03 11:03:10,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:10,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:10,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-03 11:03:10,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-03 11:03:10,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:10,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:10,334 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-03 11:03:10,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:10,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371405096] [2025-03-03 11:03:10,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371405096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:10,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:10,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:10,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044148858] [2025-03-03 11:03:10,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:10,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:10,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:10,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:10,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:10,335 INFO L87 Difference]: Start difference. First operand 2704 states and 3751 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:12,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:12,211 INFO L93 Difference]: Finished difference Result 6725 states and 9406 transitions. [2025-03-03 11:03:12,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:12,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 199 [2025-03-03 11:03:12,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:12,224 INFO L225 Difference]: With dead ends: 6725 [2025-03-03 11:03:12,224 INFO L226 Difference]: Without dead ends: 4023 [2025-03-03 11:03:12,227 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-03-03 11:03:12,228 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 508 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:12,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 240 Invalid, 1942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 11:03:12,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4023 states. [2025-03-03 11:03:12,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4023 to 4007. [2025-03-03 11:03:12,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4007 states, 4006 states have (on average 1.3946580129805293) internal successors, (5587), 4006 states have internal predecessors, (5587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:12,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4007 states to 4007 states and 5587 transitions. [2025-03-03 11:03:12,285 INFO L78 Accepts]: Start accepts. Automaton has 4007 states and 5587 transitions. Word has length 199 [2025-03-03 11:03:12,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:12,285 INFO L471 AbstractCegarLoop]: Abstraction has 4007 states and 5587 transitions. [2025-03-03 11:03:12,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:12,286 INFO L276 IsEmpty]: Start isEmpty. Operand 4007 states and 5587 transitions. [2025-03-03 11:03:12,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-03-03 11:03:12,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:12,289 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:12,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 11:03:12,289 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:12,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:12,290 INFO L85 PathProgramCache]: Analyzing trace with hash 413868107, now seen corresponding path program 1 times [2025-03-03 11:03:12,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:12,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910690511] [2025-03-03 11:03:12,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:12,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:12,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-03 11:03:12,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-03 11:03:12,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:12,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:12,682 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 85 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:03:12,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:12,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910690511] [2025-03-03 11:03:12,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910690511] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:03:12,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847936627] [2025-03-03 11:03:12,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:12,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:03:12,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:03:12,686 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:03:12,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 11:03:12,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-03 11:03:12,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-03 11:03:12,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:12,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:12,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 11:03:12,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:03:13,096 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 85 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:03:13,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:03:13,401 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:03:13,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847936627] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 11:03:13,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 11:03:13,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 7 [2025-03-03 11:03:13,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481771485] [2025-03-03 11:03:13,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:13,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:03:13,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:13,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:03:13,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 11:03:13,403 INFO L87 Difference]: Start difference. First operand 4007 states and 5587 transitions. Second operand has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:16,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:16,446 INFO L93 Difference]: Finished difference Result 13173 states and 18448 transitions. [2025-03-03 11:03:16,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:03:16,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 265 [2025-03-03 11:03:16,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:16,465 INFO L225 Difference]: With dead ends: 13173 [2025-03-03 11:03:16,465 INFO L226 Difference]: Without dead ends: 7887 [2025-03-03 11:03:16,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 11:03:16,470 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 836 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2681 mSolverCounterSat, 1228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 3909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1228 IncrementalHoareTripleChecker+Valid, 2681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:16,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 156 Invalid, 3909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1228 Valid, 2681 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-03 11:03:16,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7887 states. [2025-03-03 11:03:16,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7887 to 7849. [2025-03-03 11:03:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7849 states, 7848 states have (on average 1.2860601427115188) internal successors, (10093), 7848 states have internal predecessors, (10093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:16,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7849 states to 7849 states and 10093 transitions. [2025-03-03 11:03:16,569 INFO L78 Accepts]: Start accepts. Automaton has 7849 states and 10093 transitions. Word has length 265 [2025-03-03 11:03:16,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:16,570 INFO L471 AbstractCegarLoop]: Abstraction has 7849 states and 10093 transitions. [2025-03-03 11:03:16,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:16,571 INFO L276 IsEmpty]: Start isEmpty. Operand 7849 states and 10093 transitions. [2025-03-03 11:03:16,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-03-03 11:03:16,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:16,574 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:16,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 11:03:16,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:03:16,778 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:16,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:16,779 INFO L85 PathProgramCache]: Analyzing trace with hash -290296475, now seen corresponding path program 1 times [2025-03-03 11:03:16,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:16,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243082172] [2025-03-03 11:03:16,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:16,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:16,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-03-03 11:03:16,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-03-03 11:03:16,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:16,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:16,948 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 11:03:16,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:16,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243082172] [2025-03-03 11:03:16,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243082172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:16,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:16,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:16,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227494975] [2025-03-03 11:03:16,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:16,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:16,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:16,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:16,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:16,950 INFO L87 Difference]: Start difference. First operand 7849 states and 10093 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:18,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:18,555 INFO L93 Difference]: Finished difference Result 21222 states and 27261 transitions. [2025-03-03 11:03:18,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:18,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 283 [2025-03-03 11:03:18,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:18,579 INFO L225 Difference]: With dead ends: 21222 [2025-03-03 11:03:18,580 INFO L226 Difference]: Without dead ends: 11648 [2025-03-03 11:03:18,585 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-03-03 11:03:18,586 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 482 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:18,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 731 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 11:03:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11648 states. [2025-03-03 11:03:18,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11648 to 11646. [2025-03-03 11:03:18,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11646 states, 11645 states have (on average 1.2312580506655217) internal successors, (14338), 11645 states have internal predecessors, (14338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:18,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11646 states to 11646 states and 14338 transitions. [2025-03-03 11:03:18,736 INFO L78 Accepts]: Start accepts. Automaton has 11646 states and 14338 transitions. Word has length 283 [2025-03-03 11:03:18,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:18,737 INFO L471 AbstractCegarLoop]: Abstraction has 11646 states and 14338 transitions. [2025-03-03 11:03:18,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:18,737 INFO L276 IsEmpty]: Start isEmpty. Operand 11646 states and 14338 transitions. [2025-03-03 11:03:18,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-03 11:03:18,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:18,741 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:03:18,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 11:03:18,741 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:18,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:18,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1773091198, now seen corresponding path program 1 times [2025-03-03 11:03:18,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:18,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142600070] [2025-03-03 11:03:18,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:18,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:18,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-03 11:03:18,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-03 11:03:18,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:18,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:18,948 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 11:03:18,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:18,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142600070] [2025-03-03 11:03:18,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142600070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:18,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:18,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:18,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422845034] [2025-03-03 11:03:18,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:18,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:18,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:18,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:18,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:18,950 INFO L87 Difference]: Start difference. First operand 11646 states and 14338 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:20,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:20,145 INFO L93 Difference]: Finished difference Result 27984 states and 34322 transitions. [2025-03-03 11:03:20,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:20,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 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 302 [2025-03-03 11:03:20,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:20,169 INFO L225 Difference]: With dead ends: 27984 [2025-03-03 11:03:20,169 INFO L226 Difference]: Without dead ends: 15915 [2025-03-03 11:03:20,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:20,181 INFO L435 NwaCegarLoop]: 782 mSDtfsCounter, 411 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:20,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 849 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:03:20,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15915 states. [2025-03-03 11:03:20,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15915 to 15909. [2025-03-03 11:03:20,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15909 states, 15908 states have (on average 1.1890243902439024) internal successors, (18915), 15908 states have internal predecessors, (18915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:20,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15909 states to 15909 states and 18915 transitions. [2025-03-03 11:03:20,364 INFO L78 Accepts]: Start accepts. Automaton has 15909 states and 18915 transitions. Word has length 302 [2025-03-03 11:03:20,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:20,365 INFO L471 AbstractCegarLoop]: Abstraction has 15909 states and 18915 transitions. [2025-03-03 11:03:20,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:20,365 INFO L276 IsEmpty]: Start isEmpty. Operand 15909 states and 18915 transitions. [2025-03-03 11:03:20,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-03 11:03:20,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:20,371 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 11:03:20,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 11:03:20,372 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:20,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:20,372 INFO L85 PathProgramCache]: Analyzing trace with hash 408993381, now seen corresponding path program 1 times [2025-03-03 11:03:20,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:20,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092520013] [2025-03-03 11:03:20,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:20,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:20,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-03 11:03:20,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-03 11:03:20,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:20,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:20,534 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2025-03-03 11:03:20,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:20,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092520013] [2025-03-03 11:03:20,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092520013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:20,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:20,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:20,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680471752] [2025-03-03 11:03:20,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:20,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:20,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:20,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:20,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:20,536 INFO L87 Difference]: Start difference. First operand 15909 states and 18915 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:21,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:21,914 INFO L93 Difference]: Finished difference Result 38610 states and 45841 transitions. [2025-03-03 11:03:21,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:21,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 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 365 [2025-03-03 11:03:21,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:21,952 INFO L225 Difference]: With dead ends: 38610 [2025-03-03 11:03:21,953 INFO L226 Difference]: Without dead ends: 22702 [2025-03-03 11:03:21,966 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-03-03 11:03:21,967 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 449 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:21,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 366 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 11:03:21,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22702 states. [2025-03-03 11:03:22,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22702 to 20577. [2025-03-03 11:03:22,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20577 states, 20576 states have (on average 1.161110031104199) internal successors, (23891), 20576 states have internal predecessors, (23891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:22,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20577 states to 20577 states and 23891 transitions. [2025-03-03 11:03:22,224 INFO L78 Accepts]: Start accepts. Automaton has 20577 states and 23891 transitions. Word has length 365 [2025-03-03 11:03:22,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:22,225 INFO L471 AbstractCegarLoop]: Abstraction has 20577 states and 23891 transitions. [2025-03-03 11:03:22,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:22,225 INFO L276 IsEmpty]: Start isEmpty. Operand 20577 states and 23891 transitions. [2025-03-03 11:03:22,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-03 11:03:22,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:22,233 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 11:03:22,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 11:03:22,233 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:22,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:22,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1339557060, now seen corresponding path program 1 times [2025-03-03 11:03:22,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:22,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115835175] [2025-03-03 11:03:22,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:22,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:22,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-03 11:03:22,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-03 11:03:22,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:22,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:22,484 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-03 11:03:22,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:22,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115835175] [2025-03-03 11:03:22,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115835175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:22,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:22,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:22,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153892966] [2025-03-03 11:03:22,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:22,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:22,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:22,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:22,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:22,487 INFO L87 Difference]: Start difference. First operand 20577 states and 23891 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:23,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:23,836 INFO L93 Difference]: Finished difference Result 50935 states and 59227 transitions. [2025-03-03 11:03:23,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:23,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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-03-03 11:03:23,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:23,882 INFO L225 Difference]: With dead ends: 50935 [2025-03-03 11:03:23,882 INFO L226 Difference]: Without dead ends: 28658 [2025-03-03 11:03:23,899 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-03-03 11:03:23,899 INFO L435 NwaCegarLoop]: 715 mSDtfsCounter, 263 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:23,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 770 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:03:23,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28658 states. [2025-03-03 11:03:24,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28658 to 22692. [2025-03-03 11:03:24,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22692 states, 22691 states have (on average 1.14433035124058) internal successors, (25966), 22691 states have internal predecessors, (25966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:24,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22692 states to 22692 states and 25966 transitions. [2025-03-03 11:03:24,195 INFO L78 Accepts]: Start accepts. Automaton has 22692 states and 25966 transitions. Word has length 403 [2025-03-03 11:03:24,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:24,195 INFO L471 AbstractCegarLoop]: Abstraction has 22692 states and 25966 transitions. [2025-03-03 11:03:24,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:24,196 INFO L276 IsEmpty]: Start isEmpty. Operand 22692 states and 25966 transitions. [2025-03-03 11:03:24,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-03 11:03:24,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:24,203 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 11:03:24,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 11:03:24,204 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:24,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:24,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1206187317, now seen corresponding path program 1 times [2025-03-03 11:03:24,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:24,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188886948] [2025-03-03 11:03:24,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:24,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:24,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-03 11:03:24,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-03 11:03:24,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:24,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:24,459 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-03-03 11:03:24,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:24,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188886948] [2025-03-03 11:03:24,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188886948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:24,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:24,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:24,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279048810] [2025-03-03 11:03:24,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:24,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:24,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:24,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:24,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:24,461 INFO L87 Difference]: Start difference. First operand 22692 states and 25966 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:25,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:25,703 INFO L93 Difference]: Finished difference Result 50519 states and 57756 transitions. [2025-03-03 11:03:25,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:25,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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 408 [2025-03-03 11:03:25,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:25,730 INFO L225 Difference]: With dead ends: 50519 [2025-03-03 11:03:25,730 INFO L226 Difference]: Without dead ends: 27829 [2025-03-03 11:03:25,744 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-03-03 11:03:25,745 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 464 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:25,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 143 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:03:25,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27829 states. [2025-03-03 11:03:25,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27829 to 21840. [2025-03-03 11:03:25,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21840 states, 21839 states have (on average 1.1478547552543614) internal successors, (25068), 21839 states have internal predecessors, (25068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:25,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21840 states to 21840 states and 25068 transitions. [2025-03-03 11:03:25,983 INFO L78 Accepts]: Start accepts. Automaton has 21840 states and 25068 transitions. Word has length 408 [2025-03-03 11:03:25,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:25,984 INFO L471 AbstractCegarLoop]: Abstraction has 21840 states and 25068 transitions. [2025-03-03 11:03:25,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:25,985 INFO L276 IsEmpty]: Start isEmpty. Operand 21840 states and 25068 transitions. [2025-03-03 11:03:25,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-03-03 11:03:25,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:25,991 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 11:03:25,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 11:03:25,991 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:25,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:25,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1272775370, now seen corresponding path program 1 times [2025-03-03 11:03:25,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:25,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135903348] [2025-03-03 11:03:25,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:25,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:26,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-03 11:03:26,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-03 11:03:26,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:26,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 516 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-03 11:03:26,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:26,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135903348] [2025-03-03 11:03:26,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135903348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:26,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:26,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:26,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988926492] [2025-03-03 11:03:26,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:26,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:26,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:26,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:26,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:26,164 INFO L87 Difference]: Start difference. First operand 21840 states and 25068 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:27,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:27,348 INFO L93 Difference]: Finished difference Result 50899 states and 58681 transitions. [2025-03-03 11:03:27,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:27,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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 430 [2025-03-03 11:03:27,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:27,376 INFO L225 Difference]: With dead ends: 50899 [2025-03-03 11:03:27,376 INFO L226 Difference]: Without dead ends: 29061 [2025-03-03 11:03:27,393 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-03-03 11:03:27,393 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 303 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:27,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 764 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:03:27,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29061 states. [2025-03-03 11:03:27,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29061 to 28209. [2025-03-03 11:03:27,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28209 states, 28208 states have (on average 1.1263825865002837) internal successors, (31773), 28208 states have internal predecessors, (31773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:27,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28209 states to 28209 states and 31773 transitions. [2025-03-03 11:03:27,725 INFO L78 Accepts]: Start accepts. Automaton has 28209 states and 31773 transitions. Word has length 430 [2025-03-03 11:03:27,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:27,726 INFO L471 AbstractCegarLoop]: Abstraction has 28209 states and 31773 transitions. [2025-03-03 11:03:27,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:27,726 INFO L276 IsEmpty]: Start isEmpty. Operand 28209 states and 31773 transitions. [2025-03-03 11:03:27,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-03-03 11:03:27,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:27,734 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 11:03:27,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 11:03:27,734 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:27,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:27,735 INFO L85 PathProgramCache]: Analyzing trace with hash 239646358, now seen corresponding path program 1 times [2025-03-03 11:03:27,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:27,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435792608] [2025-03-03 11:03:27,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:27,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:27,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-03 11:03:27,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-03 11:03:27,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:27,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:28,235 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 85 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:03:28,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:28,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435792608] [2025-03-03 11:03:28,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435792608] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:03:28,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181501228] [2025-03-03 11:03:28,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:28,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:03:28,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:03:28,238 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:03:28,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 11:03:28,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-03 11:03:28,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-03 11:03:28,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:28,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:28,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 11:03:28,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:03:29,088 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 85 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:03:29,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:03:29,494 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:03:29,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181501228] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 11:03:29,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 11:03:29,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-03 11:03:29,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761156866] [2025-03-03 11:03:29,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:29,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:03:29,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:29,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:03:29,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:03:29,496 INFO L87 Difference]: Start difference. First operand 28209 states and 31773 transitions. Second operand has 4 states, 4 states have (on average 119.0) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:31,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:31,361 INFO L93 Difference]: Finished difference Result 70477 states and 78995 transitions. [2025-03-03 11:03:31,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:03:31,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 119.0) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 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 476 [2025-03-03 11:03:31,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:31,405 INFO L225 Difference]: With dead ends: 70477 [2025-03-03 11:03:31,405 INFO L226 Difference]: Without dead ends: 40992 [2025-03-03 11:03:31,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 953 GetRequests, 949 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:03:31,426 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 566 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 2116 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 2576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 2116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:31,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 149 Invalid, 2576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 2116 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 11:03:31,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40992 states. [2025-03-03 11:03:31,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40992 to 38864. [2025-03-03 11:03:31,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38864 states, 38863 states have (on average 1.1195738877595656) internal successors, (43510), 38863 states have internal predecessors, (43510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:31,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38864 states to 38864 states and 43510 transitions. [2025-03-03 11:03:31,793 INFO L78 Accepts]: Start accepts. Automaton has 38864 states and 43510 transitions. Word has length 476 [2025-03-03 11:03:31,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:31,795 INFO L471 AbstractCegarLoop]: Abstraction has 38864 states and 43510 transitions. [2025-03-03 11:03:31,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.0) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 38864 states and 43510 transitions. [2025-03-03 11:03:31,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-03-03 11:03:31,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:31,804 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 11:03:31,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 11:03:32,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 11:03:32,004 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:32,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:32,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1819849320, now seen corresponding path program 1 times [2025-03-03 11:03:32,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:32,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818424486] [2025-03-03 11:03:32,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:32,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:32,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-03-03 11:03:32,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-03-03 11:03:32,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:32,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:32,466 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 118 proven. 241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:03:32,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:32,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818424486] [2025-03-03 11:03:32,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818424486] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:03:32,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006070469] [2025-03-03 11:03:32,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:32,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:03:32,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:03:32,469 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:03:32,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 11:03:32,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-03-03 11:03:32,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-03-03 11:03:32,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:32,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:32,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 11:03:32,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:03:33,083 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 118 proven. 241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:03:33,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:03:33,490 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 316 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:03:33,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006070469] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 11:03:33,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 11:03:33,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-03 11:03:33,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330684962] [2025-03-03 11:03:33,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 11:03:33,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 11:03:33,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:33,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 11:03:33,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2025-03-03 11:03:33,493 INFO L87 Difference]: Start difference. First operand 38864 states and 43510 transitions. Second operand has 10 states, 10 states have (on average 103.7) internal successors, (1037), 9 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:37,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:37,871 INFO L93 Difference]: Finished difference Result 104132 states and 115619 transitions. [2025-03-03 11:03:37,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 11:03:37,871 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 103.7) internal successors, (1037), 9 states have internal predecessors, (1037), 0 states have call successors, (0), 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 519 [2025-03-03 11:03:37,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:37,939 INFO L225 Difference]: With dead ends: 104132 [2025-03-03 11:03:37,939 INFO L226 Difference]: Without dead ends: 63570 [2025-03-03 11:03:37,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1041 GetRequests, 1033 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2025-03-03 11:03:37,969 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 3063 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 7489 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3063 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 8487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 7489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:37,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3063 Valid, 410 Invalid, 8487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 7489 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-03 11:03:38,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63570 states. [2025-03-03 11:03:38,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63570 to 43131. [2025-03-03 11:03:38,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43131 states, 43130 states have (on average 1.1098539299791328) internal successors, (47868), 43130 states have internal predecessors, (47868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:38,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43131 states to 43131 states and 47868 transitions. [2025-03-03 11:03:38,441 INFO L78 Accepts]: Start accepts. Automaton has 43131 states and 47868 transitions. Word has length 519 [2025-03-03 11:03:38,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:38,441 INFO L471 AbstractCegarLoop]: Abstraction has 43131 states and 47868 transitions. [2025-03-03 11:03:38,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 103.7) internal successors, (1037), 9 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:38,442 INFO L276 IsEmpty]: Start isEmpty. Operand 43131 states and 47868 transitions. [2025-03-03 11:03:38,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2025-03-03 11:03:38,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:38,451 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 11:03:38,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 11:03:38,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:03:38,655 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:38,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:38,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1118563241, now seen corresponding path program 1 times [2025-03-03 11:03:38,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:38,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477327825] [2025-03-03 11:03:38,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:38,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:38,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 524 statements into 1 equivalence classes. [2025-03-03 11:03:38,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 524 of 524 statements. [2025-03-03 11:03:38,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:38,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:38,863 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-03 11:03:38,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:38,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477327825] [2025-03-03 11:03:38,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477327825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:38,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:38,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:38,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775785023] [2025-03-03 11:03:38,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:38,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:38,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:38,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:38,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:38,864 INFO L87 Difference]: Start difference. First operand 43131 states and 47868 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:40,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:40,176 INFO L93 Difference]: Finished difference Result 97743 states and 108725 transitions. [2025-03-03 11:03:40,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:40,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 524 [2025-03-03 11:03:40,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:40,230 INFO L225 Difference]: With dead ends: 97743 [2025-03-03 11:03:40,230 INFO L226 Difference]: Without dead ends: 50779 [2025-03-03 11:03:40,259 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-03-03 11:03:40,260 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 484 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:40,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 715 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:03:40,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50779 states. [2025-03-03 11:03:40,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50779 to 50773. [2025-03-03 11:03:40,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50773 states, 50772 states have (on average 1.0961159694319704) internal successors, (55652), 50772 states have internal predecessors, (55652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:40,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50773 states to 50773 states and 55652 transitions. [2025-03-03 11:03:40,761 INFO L78 Accepts]: Start accepts. Automaton has 50773 states and 55652 transitions. Word has length 524 [2025-03-03 11:03:40,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:40,761 INFO L471 AbstractCegarLoop]: Abstraction has 50773 states and 55652 transitions. [2025-03-03 11:03:40,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:40,762 INFO L276 IsEmpty]: Start isEmpty. Operand 50773 states and 55652 transitions. [2025-03-03 11:03:40,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2025-03-03 11:03:40,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:40,777 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 11:03:40,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 11:03:40,777 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:40,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:40,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1002065067, now seen corresponding path program 1 times [2025-03-03 11:03:40,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:40,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867113728] [2025-03-03 11:03:40,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:40,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:40,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 635 statements into 1 equivalence classes. [2025-03-03 11:03:40,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 635 of 635 statements. [2025-03-03 11:03:40,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:40,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:41,167 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 11:03:41,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:41,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867113728] [2025-03-03 11:03:41,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867113728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:41,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:41,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:03:41,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785148544] [2025-03-03 11:03:41,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:41,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:41,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:41,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:41,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:41,169 INFO L87 Difference]: Start difference. First operand 50773 states and 55652 transitions. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 2 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:41,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:41,917 INFO L93 Difference]: Finished difference Result 99409 states and 108859 transitions. [2025-03-03 11:03:41,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:41,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 2 states have internal predecessors, (408), 0 states have call successors, (0), 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 635 [2025-03-03 11:03:41,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:41,971 INFO L225 Difference]: With dead ends: 99409 [2025-03-03 11:03:41,971 INFO L226 Difference]: Without dead ends: 49061 [2025-03-03 11:03:42,003 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-03-03 11:03:42,004 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 397 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:42,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 94 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 11:03:42,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49061 states. [2025-03-03 11:03:42,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49061 to 49056. [2025-03-03 11:03:42,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49056 states, 49055 states have (on average 1.0929568851289369) internal successors, (53615), 49055 states have internal predecessors, (53615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49056 states to 49056 states and 53615 transitions. [2025-03-03 11:03:42,505 INFO L78 Accepts]: Start accepts. Automaton has 49056 states and 53615 transitions. Word has length 635 [2025-03-03 11:03:42,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:42,506 INFO L471 AbstractCegarLoop]: Abstraction has 49056 states and 53615 transitions. [2025-03-03 11:03:42,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 2 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 49056 states and 53615 transitions. [2025-03-03 11:03:42,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2025-03-03 11:03:42,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:42,520 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 11:03:42,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 11:03:42,520 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:42,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:42,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1524719848, now seen corresponding path program 1 times [2025-03-03 11:03:42,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:42,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680841070] [2025-03-03 11:03:42,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:42,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:42,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 661 statements into 1 equivalence classes. [2025-03-03 11:03:42,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 661 of 661 statements. [2025-03-03 11:03:42,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:42,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:42,707 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 11:03:42,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:42,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680841070] [2025-03-03 11:03:42,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680841070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:42,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:42,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:42,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541743718] [2025-03-03 11:03:42,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:42,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:42,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:42,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:42,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:42,708 INFO L87 Difference]: Start difference. First operand 49056 states and 53615 transitions. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:43,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:43,971 INFO L93 Difference]: Finished difference Result 105758 states and 115876 transitions. [2025-03-03 11:03:43,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:43,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 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 661 [2025-03-03 11:03:43,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:44,029 INFO L225 Difference]: With dead ends: 105758 [2025-03-03 11:03:44,029 INFO L226 Difference]: Without dead ends: 57129 [2025-03-03 11:03:44,044 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-03-03 11:03:44,045 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 439 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:44,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 343 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:03:44,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57129 states. [2025-03-03 11:03:44,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57129 to 53300. [2025-03-03 11:03:44,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53300 states, 53299 states have (on average 1.0861179384228596) internal successors, (57889), 53299 states have internal predecessors, (57889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:44,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53300 states to 53300 states and 57889 transitions. [2025-03-03 11:03:44,509 INFO L78 Accepts]: Start accepts. Automaton has 53300 states and 57889 transitions. Word has length 661 [2025-03-03 11:03:44,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:44,509 INFO L471 AbstractCegarLoop]: Abstraction has 53300 states and 57889 transitions. [2025-03-03 11:03:44,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:44,509 INFO L276 IsEmpty]: Start isEmpty. Operand 53300 states and 57889 transitions. [2025-03-03 11:03:44,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2025-03-03 11:03:44,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:44,525 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 11:03:44,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 11:03:44,525 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:44,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:44,526 INFO L85 PathProgramCache]: Analyzing trace with hash 301637685, now seen corresponding path program 1 times [2025-03-03 11:03:44,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:44,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716395892] [2025-03-03 11:03:44,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:44,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:44,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 687 statements into 1 equivalence classes. [2025-03-03 11:03:44,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 687 of 687 statements. [2025-03-03 11:03:44,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:44,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:45,456 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-03 11:03:45,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:45,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716395892] [2025-03-03 11:03:45,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716395892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:45,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:45,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:45,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259626197] [2025-03-03 11:03:45,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:45,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:45,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:45,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:45,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:45,459 INFO L87 Difference]: Start difference. First operand 53300 states and 57889 transitions. Second operand has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:46,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:46,703 INFO L93 Difference]: Finished difference Result 109159 states and 118623 transitions. [2025-03-03 11:03:46,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:46,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 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 687 [2025-03-03 11:03:46,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:46,762 INFO L225 Difference]: With dead ends: 109159 [2025-03-03 11:03:46,762 INFO L226 Difference]: Without dead ends: 56286 [2025-03-03 11:03:46,797 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-03-03 11:03:46,798 INFO L435 NwaCegarLoop]: 709 mSDtfsCounter, 366 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:46,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 766 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 11:03:46,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56286 states. [2025-03-03 11:03:47,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56286 to 56279. [2025-03-03 11:03:47,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56279 states, 56278 states have (on average 1.0838693628060698) internal successors, (60998), 56278 states have internal predecessors, (60998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:47,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56279 states to 56279 states and 60998 transitions. [2025-03-03 11:03:47,490 INFO L78 Accepts]: Start accepts. Automaton has 56279 states and 60998 transitions. Word has length 687 [2025-03-03 11:03:47,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:47,490 INFO L471 AbstractCegarLoop]: Abstraction has 56279 states and 60998 transitions. [2025-03-03 11:03:47,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:47,490 INFO L276 IsEmpty]: Start isEmpty. Operand 56279 states and 60998 transitions. [2025-03-03 11:03:47,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-03-03 11:03:47,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:47,506 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 11:03:47,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 11:03:47,506 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:47,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:47,507 INFO L85 PathProgramCache]: Analyzing trace with hash 152979532, now seen corresponding path program 1 times [2025-03-03 11:03:47,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:47,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391202052] [2025-03-03 11:03:47,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:47,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:47,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-03-03 11:03:47,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-03-03 11:03:47,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:47,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:47,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 778 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-03 11:03:47,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:47,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391202052] [2025-03-03 11:03:47,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391202052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:47,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:47,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:47,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130673561] [2025-03-03 11:03:47,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:47,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:47,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:47,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:47,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:47,928 INFO L87 Difference]: Start difference. First operand 56279 states and 60998 transitions. Second operand has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:49,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:49,274 INFO L93 Difference]: Finished difference Result 121081 states and 131457 transitions. [2025-03-03 11:03:49,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:49,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 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 688 [2025-03-03 11:03:49,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:49,338 INFO L225 Difference]: With dead ends: 121081 [2025-03-03 11:03:49,338 INFO L226 Difference]: Without dead ends: 63527 [2025-03-03 11:03:49,372 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-03-03 11:03:49,372 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 415 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:49,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 634 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:03:49,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63527 states. [2025-03-03 11:03:49,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63527 to 61818. [2025-03-03 11:03:49,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61818 states, 61817 states have (on average 1.0852192762508694) internal successors, (67085), 61817 states have internal predecessors, (67085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:49,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61818 states to 61818 states and 67085 transitions. [2025-03-03 11:03:49,922 INFO L78 Accepts]: Start accepts. Automaton has 61818 states and 67085 transitions. Word has length 688 [2025-03-03 11:03:49,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:49,922 INFO L471 AbstractCegarLoop]: Abstraction has 61818 states and 67085 transitions. [2025-03-03 11:03:49,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:49,922 INFO L276 IsEmpty]: Start isEmpty. Operand 61818 states and 67085 transitions. [2025-03-03 11:03:49,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2025-03-03 11:03:49,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:49,937 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:49,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 11:03:49,938 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:49,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:49,938 INFO L85 PathProgramCache]: Analyzing trace with hash 657644340, now seen corresponding path program 1 times [2025-03-03 11:03:49,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:49,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005341332] [2025-03-03 11:03:49,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:49,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:49,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-03-03 11:03:49,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-03-03 11:03:49,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:49,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:50,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 841 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-03 11:03:50,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:50,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005341332] [2025-03-03 11:03:50,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005341332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:50,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:50,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:03:50,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382456740] [2025-03-03 11:03:50,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:50,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:03:50,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:50,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:03:50,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:03:50,395 INFO L87 Difference]: Start difference. First operand 61818 states and 67085 transitions. Second operand has 4 states, 4 states have (on average 145.5) internal successors, (582), 4 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:52,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:52,262 INFO L93 Difference]: Finished difference Result 142389 states and 154759 transitions. [2025-03-03 11:03:52,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:03:52,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 145.5) internal successors, (582), 4 states have internal predecessors, (582), 0 states have call successors, (0), 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 698 [2025-03-03 11:03:52,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:52,337 INFO L225 Difference]: With dead ends: 142389 [2025-03-03 11:03:52,337 INFO L226 Difference]: Without dead ends: 80998 [2025-03-03 11:03:52,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:03:52,376 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 816 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2218 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 2622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 2218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:52,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 167 Invalid, 2622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 2218 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 11:03:52,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80998 states. [2025-03-03 11:03:53,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80998 to 77161. [2025-03-03 11:03:53,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77161 states, 77160 states have (on average 1.088867288750648) internal successors, (84017), 77160 states have internal predecessors, (84017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:53,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77161 states to 77161 states and 84017 transitions. [2025-03-03 11:03:53,247 INFO L78 Accepts]: Start accepts. Automaton has 77161 states and 84017 transitions. Word has length 698 [2025-03-03 11:03:53,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:53,248 INFO L471 AbstractCegarLoop]: Abstraction has 77161 states and 84017 transitions. [2025-03-03 11:03:53,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 145.5) internal successors, (582), 4 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:53,248 INFO L276 IsEmpty]: Start isEmpty. Operand 77161 states and 84017 transitions. [2025-03-03 11:03:53,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2025-03-03 11:03:53,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:53,264 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:53,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 11:03:53,265 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:53,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:53,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1945189319, now seen corresponding path program 1 times [2025-03-03 11:03:53,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:53,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270294794] [2025-03-03 11:03:53,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:53,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:53,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 711 statements into 1 equivalence classes. [2025-03-03 11:03:53,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 711 of 711 statements. [2025-03-03 11:03:53,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:53,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:53,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 817 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-03-03 11:03:53,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:53,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270294794] [2025-03-03 11:03:53,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270294794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:53,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:53,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:53,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174764554] [2025-03-03 11:03:53,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:53,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:53,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:53,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:53,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:53,544 INFO L87 Difference]: Start difference. First operand 77161 states and 84017 transitions. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:54,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:54,932 INFO L93 Difference]: Finished difference Result 167090 states and 182084 transitions. [2025-03-03 11:03:54,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:54,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 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 711 [2025-03-03 11:03:54,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:55,016 INFO L225 Difference]: With dead ends: 167090 [2025-03-03 11:03:55,016 INFO L226 Difference]: Without dead ends: 90356 [2025-03-03 11:03:55,052 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-03-03 11:03:55,052 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 378 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:55,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 274 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 11:03:55,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90356 states. [2025-03-03 11:03:55,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90356 to 88226. [2025-03-03 11:03:56,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88226 states, 88225 states have (on average 1.0848625672995182) internal successors, (95712), 88225 states have internal predecessors, (95712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:56,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88226 states to 88226 states and 95712 transitions. [2025-03-03 11:03:56,137 INFO L78 Accepts]: Start accepts. Automaton has 88226 states and 95712 transitions. Word has length 711 [2025-03-03 11:03:56,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:56,138 INFO L471 AbstractCegarLoop]: Abstraction has 88226 states and 95712 transitions. [2025-03-03 11:03:56,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:56,138 INFO L276 IsEmpty]: Start isEmpty. Operand 88226 states and 95712 transitions. [2025-03-03 11:03:56,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 719 [2025-03-03 11:03:56,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:56,163 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:03:56,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 11:03:56,164 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:56,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:56,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1873778174, now seen corresponding path program 1 times [2025-03-03 11:03:56,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:56,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416224317] [2025-03-03 11:03:56,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:56,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:56,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 718 statements into 1 equivalence classes. [2025-03-03 11:03:56,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 718 of 718 statements. [2025-03-03 11:03:56,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:56,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:56,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1022 backedges. 750 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-03 11:03:56,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:56,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416224317] [2025-03-03 11:03:56,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416224317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:56,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:56,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:56,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524964979] [2025-03-03 11:03:56,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:56,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:56,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:56,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:56,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:56,928 INFO L87 Difference]: Start difference. First operand 88226 states and 95712 transitions. Second operand has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:58,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:03:58,217 INFO L93 Difference]: Finished difference Result 178154 states and 193208 transitions. [2025-03-03 11:03:58,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:03:58,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 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 718 [2025-03-03 11:03:58,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:03:58,305 INFO L225 Difference]: With dead ends: 178154 [2025-03-03 11:03:58,305 INFO L226 Difference]: Without dead ends: 90355 [2025-03-03 11:03:58,335 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-03-03 11:03:58,336 INFO L435 NwaCegarLoop]: 718 mSDtfsCounter, 114 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 11:03:58,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 765 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 11:03:58,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90355 states. [2025-03-03 11:03:59,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90355 to 89927. [2025-03-03 11:03:59,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89927 states, 89926 states have (on average 1.0827458132242065) internal successors, (97367), 89926 states have internal predecessors, (97367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89927 states to 89927 states and 97367 transitions. [2025-03-03 11:03:59,413 INFO L78 Accepts]: Start accepts. Automaton has 89927 states and 97367 transitions. Word has length 718 [2025-03-03 11:03:59,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:03:59,413 INFO L471 AbstractCegarLoop]: Abstraction has 89927 states and 97367 transitions. [2025-03-03 11:03:59,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:03:59,413 INFO L276 IsEmpty]: Start isEmpty. Operand 89927 states and 97367 transitions. [2025-03-03 11:03:59,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2025-03-03 11:03:59,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:03:59,437 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 11:03:59,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 11:03:59,437 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:03:59,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:03:59,438 INFO L85 PathProgramCache]: Analyzing trace with hash -952743050, now seen corresponding path program 1 times [2025-03-03 11:03:59,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:03:59,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141623902] [2025-03-03 11:03:59,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:03:59,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:03:59,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 746 statements into 1 equivalence classes. [2025-03-03 11:03:59,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 746 of 746 statements. [2025-03-03 11:03:59,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:03:59,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:03:59,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1061 backedges. 818 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-03-03 11:03:59,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:03:59,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141623902] [2025-03-03 11:03:59,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141623902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:03:59,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:03:59,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:03:59,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962158787] [2025-03-03 11:03:59,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:03:59,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:03:59,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:03:59,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:03:59,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:03:59,960 INFO L87 Difference]: Start difference. First operand 89927 states and 97367 transitions. Second operand has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:01,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:04:01,441 INFO L93 Difference]: Finished difference Result 189662 states and 205401 transitions. [2025-03-03 11:04:01,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:04:01,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 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 746 [2025-03-03 11:04:01,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:04:01,545 INFO L225 Difference]: With dead ends: 189662 [2025-03-03 11:04:01,545 INFO L226 Difference]: Without dead ends: 100162 [2025-03-03 11:04:01,588 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-03-03 11:04:01,589 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 415 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:04:01,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 220 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:04:01,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100162 states. [2025-03-03 11:04:02,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100162 to 92907. [2025-03-03 11:04:02,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92907 states, 92906 states have (on average 1.0787785503627323) internal successors, (100225), 92906 states have internal predecessors, (100225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:02,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92907 states to 92907 states and 100225 transitions. [2025-03-03 11:04:02,686 INFO L78 Accepts]: Start accepts. Automaton has 92907 states and 100225 transitions. Word has length 746 [2025-03-03 11:04:02,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:04:02,686 INFO L471 AbstractCegarLoop]: Abstraction has 92907 states and 100225 transitions. [2025-03-03 11:04:02,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:02,686 INFO L276 IsEmpty]: Start isEmpty. Operand 92907 states and 100225 transitions. [2025-03-03 11:04:02,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2025-03-03 11:04:02,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:04:02,707 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:04:02,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 11:04:02,708 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:04:02,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:04:02,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1196060287, now seen corresponding path program 1 times [2025-03-03 11:04:02,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:04:02,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344488] [2025-03-03 11:04:02,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:04:02,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:04:02,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 752 statements into 1 equivalence classes. [2025-03-03 11:04:02,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 752 of 752 statements. [2025-03-03 11:04:02,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:04:02,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:04:03,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 785 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2025-03-03 11:04:03,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:04:03,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344488] [2025-03-03 11:04:03,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:04:03,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:04:03,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:04:03,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657876396] [2025-03-03 11:04:03,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:04:03,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:04:03,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:04:03,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:04:03,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:04:03,455 INFO L87 Difference]: Start difference. First operand 92907 states and 100225 transitions. Second operand has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:04,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:04:04,938 INFO L93 Difference]: Finished difference Result 187089 states and 201801 transitions. [2025-03-03 11:04:04,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:04:04,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 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 752 [2025-03-03 11:04:04,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:04:05,041 INFO L225 Difference]: With dead ends: 187089 [2025-03-03 11:04:05,042 INFO L226 Difference]: Without dead ends: 94609 [2025-03-03 11:04:05,097 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-03-03 11:04:05,098 INFO L435 NwaCegarLoop]: 688 mSDtfsCounter, 126 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:04:05,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 730 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:04:05,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94609 states. [2025-03-03 11:04:06,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94609 to 94609. [2025-03-03 11:04:06,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94609 states, 94608 states have (on average 1.0740529342127516) internal successors, (101614), 94608 states have internal predecessors, (101614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:06,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94609 states to 94609 states and 101614 transitions. [2025-03-03 11:04:06,354 INFO L78 Accepts]: Start accepts. Automaton has 94609 states and 101614 transitions. Word has length 752 [2025-03-03 11:04:06,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:04:06,354 INFO L471 AbstractCegarLoop]: Abstraction has 94609 states and 101614 transitions. [2025-03-03 11:04:06,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:06,354 INFO L276 IsEmpty]: Start isEmpty. Operand 94609 states and 101614 transitions. [2025-03-03 11:04:06,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 855 [2025-03-03 11:04:06,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:04:06,378 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 11:04:06,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 11:04:06,378 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:04:06,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:04:06,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1166207080, now seen corresponding path program 1 times [2025-03-03 11:04:06,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:04:06,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352299950] [2025-03-03 11:04:06,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:04:06,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:04:06,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 854 statements into 1 equivalence classes. [2025-03-03 11:04:06,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 854 of 854 statements. [2025-03-03 11:04:06,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:04:06,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:04:06,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1197 backedges. 813 proven. 0 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-03-03 11:04:06,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:04:06,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352299950] [2025-03-03 11:04:06,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352299950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:04:06,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:04:06,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:04:06,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031567768] [2025-03-03 11:04:06,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:04:06,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:04:06,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:04:06,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:04:06,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:04:06,848 INFO L87 Difference]: Start difference. First operand 94609 states and 101614 transitions. Second operand has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:08,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:04:08,175 INFO L93 Difference]: Finished difference Result 188795 states and 202863 transitions. [2025-03-03 11:04:08,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:04:08,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 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 854 [2025-03-03 11:04:08,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:04:08,279 INFO L225 Difference]: With dead ends: 188795 [2025-03-03 11:04:08,279 INFO L226 Difference]: Without dead ends: 94613 [2025-03-03 11:04:08,333 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-03-03 11:04:08,334 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 86 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:04:08,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 727 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 11:04:08,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94613 states. [2025-03-03 11:04:09,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94613 to 91626. [2025-03-03 11:04:09,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91626 states, 91625 states have (on average 1.069467939972715) internal successors, (97990), 91625 states have internal predecessors, (97990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:09,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91626 states to 91626 states and 97990 transitions. [2025-03-03 11:04:09,303 INFO L78 Accepts]: Start accepts. Automaton has 91626 states and 97990 transitions. Word has length 854 [2025-03-03 11:04:09,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:04:09,304 INFO L471 AbstractCegarLoop]: Abstraction has 91626 states and 97990 transitions. [2025-03-03 11:04:09,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:09,304 INFO L276 IsEmpty]: Start isEmpty. Operand 91626 states and 97990 transitions. [2025-03-03 11:04:09,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1143 [2025-03-03 11:04:09,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:04:09,353 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:04:09,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 11:04:09,354 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:04:09,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:04:09,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1428378908, now seen corresponding path program 1 times [2025-03-03 11:04:09,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:04:09,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941975696] [2025-03-03 11:04:09,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:04:09,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:04:09,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1142 statements into 1 equivalence classes. [2025-03-03 11:04:09,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1142 of 1142 statements. [2025-03-03 11:04:09,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:04:09,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:04:09,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1629 backedges. 1276 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2025-03-03 11:04:09,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:04:09,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941975696] [2025-03-03 11:04:09,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941975696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:04:09,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:04:09,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:04:09,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086922367] [2025-03-03 11:04:09,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:04:09,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:04:09,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:04:09,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:04:09,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:04:09,934 INFO L87 Difference]: Start difference. First operand 91626 states and 97990 transitions. Second operand has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:11,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:04:11,289 INFO L93 Difference]: Finished difference Result 180266 states and 192756 transitions. [2025-03-03 11:04:11,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:04:11,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 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 1142 [2025-03-03 11:04:11,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:04:11,374 INFO L225 Difference]: With dead ends: 180266 [2025-03-03 11:04:11,374 INFO L226 Difference]: Without dead ends: 89067 [2025-03-03 11:04:11,415 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-03-03 11:04:11,416 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 129 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:04:11,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 664 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 11:04:11,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89067 states. [2025-03-03 11:04:12,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89067 to 86085. [2025-03-03 11:04:12,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86085 states, 86084 states have (on average 1.0620092003159705) internal successors, (91422), 86084 states have internal predecessors, (91422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:12,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86085 states to 86085 states and 91422 transitions. [2025-03-03 11:04:12,774 INFO L78 Accepts]: Start accepts. Automaton has 86085 states and 91422 transitions. Word has length 1142 [2025-03-03 11:04:12,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:04:12,775 INFO L471 AbstractCegarLoop]: Abstraction has 86085 states and 91422 transitions. [2025-03-03 11:04:12,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:12,775 INFO L276 IsEmpty]: Start isEmpty. Operand 86085 states and 91422 transitions. [2025-03-03 11:04:12,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1146 [2025-03-03 11:04:12,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:04:12,823 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:04:12,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 11:04:12,824 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:04:12,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:04:12,824 INFO L85 PathProgramCache]: Analyzing trace with hash -144286346, now seen corresponding path program 1 times [2025-03-03 11:04:12,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:04:12,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869449933] [2025-03-03 11:04:12,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:04:12,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:04:12,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1145 statements into 1 equivalence classes. [2025-03-03 11:04:12,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1145 of 1145 statements. [2025-03-03 11:04:12,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:04:12,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:04:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1994 backedges. 1646 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2025-03-03 11:04:13,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:04:13,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869449933] [2025-03-03 11:04:13,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869449933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:04:13,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:04:13,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 11:04:13,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252524814] [2025-03-03 11:04:13,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:04:13,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 11:04:13,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:04:13,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 11:04:13,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:04:13,442 INFO L87 Difference]: Start difference. First operand 86085 states and 91422 transitions. Second operand has 5 states, 5 states have (on average 176.4) internal successors, (882), 5 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:15,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:04:15,802 INFO L93 Difference]: Finished difference Result 189605 states and 201691 transitions. [2025-03-03 11:04:15,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 11:04:15,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 176.4) internal successors, (882), 5 states have internal predecessors, (882), 0 states have call successors, (0), 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 1145 [2025-03-03 11:04:15,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:04:15,924 INFO L225 Difference]: With dead ends: 189605 [2025-03-03 11:04:15,924 INFO L226 Difference]: Without dead ends: 103097 [2025-03-03 11:04:15,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:04:15,976 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 794 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 3120 mSolverCounterSat, 558 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 3678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 558 IncrementalHoareTripleChecker+Valid, 3120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:04:15,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 138 Invalid, 3678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [558 Valid, 3120 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 11:04:16,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103097 states. [2025-03-03 11:04:16,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103097 to 90321. [2025-03-03 11:04:16,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90321 states, 90320 states have (on average 1.0601527900797165) internal successors, (95753), 90320 states have internal predecessors, (95753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:16,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90321 states to 90321 states and 95753 transitions. [2025-03-03 11:04:16,909 INFO L78 Accepts]: Start accepts. Automaton has 90321 states and 95753 transitions. Word has length 1145 [2025-03-03 11:04:16,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:04:16,909 INFO L471 AbstractCegarLoop]: Abstraction has 90321 states and 95753 transitions. [2025-03-03 11:04:16,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 176.4) internal successors, (882), 5 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:16,909 INFO L276 IsEmpty]: Start isEmpty. Operand 90321 states and 95753 transitions. [2025-03-03 11:04:16,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1214 [2025-03-03 11:04:16,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:04:16,961 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:04:16,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 11:04:16,961 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:04:16,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:04:16,962 INFO L85 PathProgramCache]: Analyzing trace with hash -947294214, now seen corresponding path program 1 times [2025-03-03 11:04:16,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:04:16,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880294073] [2025-03-03 11:04:16,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:04:16,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:04:17,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1213 statements into 1 equivalence classes. [2025-03-03 11:04:17,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1213 of 1213 statements. [2025-03-03 11:04:17,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:04:17,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:04:18,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2470 backedges. 1781 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2025-03-03 11:04:18,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:04:18,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880294073] [2025-03-03 11:04:18,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880294073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:04:18,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:04:18,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:04:18,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733179565] [2025-03-03 11:04:18,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:04:18,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:04:18,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:04:18,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:04:18,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:04:18,011 INFO L87 Difference]: Start difference. First operand 90321 states and 95753 transitions. Second operand has 3 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:19,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:04:19,193 INFO L93 Difference]: Finished difference Result 178940 states and 189618 transitions. [2025-03-03 11:04:19,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:04:19,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 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 1213 [2025-03-03 11:04:19,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:04:19,301 INFO L225 Difference]: With dead ends: 178940 [2025-03-03 11:04:19,301 INFO L226 Difference]: Without dead ends: 89046 [2025-03-03 11:04:19,364 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-03-03 11:04:19,365 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 128 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 11:04:19,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 677 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 11:04:19,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89046 states. [2025-03-03 11:04:20,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89046 to 83086. [2025-03-03 11:04:20,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83086 states, 83085 states have (on average 1.0553649876632365) internal successors, (87685), 83085 states have internal predecessors, (87685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:20,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83086 states to 83086 states and 87685 transitions. [2025-03-03 11:04:20,452 INFO L78 Accepts]: Start accepts. Automaton has 83086 states and 87685 transitions. Word has length 1213 [2025-03-03 11:04:20,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:04:20,453 INFO L471 AbstractCegarLoop]: Abstraction has 83086 states and 87685 transitions. [2025-03-03 11:04:20,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:20,453 INFO L276 IsEmpty]: Start isEmpty. Operand 83086 states and 87685 transitions. [2025-03-03 11:04:20,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1325 [2025-03-03 11:04:20,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:04:20,687 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:04:20,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 11:04:20,687 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:04:20,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:04:20,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1678167604, now seen corresponding path program 1 times [2025-03-03 11:04:20,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:04:20,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502534320] [2025-03-03 11:04:20,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:04:20,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:04:20,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1324 statements into 1 equivalence classes. [2025-03-03 11:04:20,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1324 of 1324 statements. [2025-03-03 11:04:20,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:04:20,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:04:21,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3196 backedges. 2074 proven. 0 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2025-03-03 11:04:21,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:04:21,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502534320] [2025-03-03 11:04:21,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502534320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:04:21,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:04:21,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:04:21,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372991849] [2025-03-03 11:04:21,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:04:21,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:04:21,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:04:21,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:04:21,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:04:21,610 INFO L87 Difference]: Start difference. First operand 83086 states and 87685 transitions. Second operand has 4 states, 4 states have (on average 153.5) internal successors, (614), 4 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)