./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/Problem18_label10.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 c88f0048b6e3f16e3064641eeb61720e8ffc398aaa06b34533fd59b3d3fd0a1f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:22:38,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:22:38,452 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:22:38,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:22:38,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:22:38,483 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:22:38,484 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:22:38,484 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:22:38,484 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:22:38,484 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:22:38,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:22:38,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:22:38,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:22:38,486 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:22:38,486 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:22:38,486 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:22:38,486 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:22:38,486 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:22:38,486 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:22:38,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:22:38,486 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:22:38,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:22:38,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:22:38,486 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:22:38,486 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:22:38,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:22:38,486 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:22:38,487 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:22:38,487 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:22:38,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:22:38,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:22:38,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:22:38,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:22:38,487 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:22:38,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:22:38,487 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:22:38,487 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:22:38,487 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:22:38,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:22:38,487 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:22:38,487 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:22:38,487 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:22:38,487 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:22:38,487 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 -> c88f0048b6e3f16e3064641eeb61720e8ffc398aaa06b34533fd59b3d3fd0a1f [2025-03-16 15:22:38,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:22:38,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:22:38,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:22:38,716 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:22:38,716 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:22:38,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label10.c [2025-03-16 15:22:39,869 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cc450e5d/a681f583a5a64b0b99e3abfb9d10965f/FLAGa7271393f [2025-03-16 15:22:40,230 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:22:40,231 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label10.c [2025-03-16 15:22:40,254 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cc450e5d/a681f583a5a64b0b99e3abfb9d10965f/FLAGa7271393f [2025-03-16 15:22:40,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cc450e5d/a681f583a5a64b0b99e3abfb9d10965f [2025-03-16 15:22:40,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:22:40,270 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:22:40,272 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:22:40,272 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:22:40,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:22:40,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:22:40" (1/1) ... [2025-03-16 15:22:40,276 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ebe9ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:22:40, skipping insertion in model container [2025-03-16 15:22:40,276 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:22:40" (1/1) ... [2025-03-16 15:22:40,338 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:22:40,480 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/Problem18_label10.c[2213,2226] [2025-03-16 15:22:40,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:22:40,880 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:22:40,895 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/Problem18_label10.c[2213,2226] [2025-03-16 15:22:41,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:22:41,096 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:22:41,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:22:41 WrapperNode [2025-03-16 15:22:41,097 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:22:41,098 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:22:41,098 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:22:41,098 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:22:41,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:22:41" (1/1) ... [2025-03-16 15:22:41,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:22:41" (1/1) ... [2025-03-16 15:22:41,292 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2025-03-16 15:22:41,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:22:41,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:22:41,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:22:41,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:22:41,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:22:41" (1/1) ... [2025-03-16 15:22:41,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:22:41" (1/1) ... [2025-03-16 15:22:41,331 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:22:41" (1/1) ... [2025-03-16 15:22:41,413 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-16 15:22:41,417 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:22:41" (1/1) ... [2025-03-16 15:22:41,417 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:22:41" (1/1) ... [2025-03-16 15:22:41,470 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:22:41" (1/1) ... [2025-03-16 15:22:41,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:22:41" (1/1) ... [2025-03-16 15:22:41,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:22:41" (1/1) ... [2025-03-16 15:22:41,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:22:41" (1/1) ... [2025-03-16 15:22:41,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:22:41,520 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:22:41,520 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:22:41,520 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:22:41,521 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:22:41" (1/1) ... [2025-03-16 15:22:41,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:22:41,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:22:41,544 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-16 15:22:41,547 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-16 15:22:41,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:22:41,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:22:41,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:22:41,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:22:41,615 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:22:41,616 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:22:44,171 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647: havoc calculate_output_#t~ret8#1; [2025-03-16 15:22:44,172 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: havoc calculate_output2_#t~ret9#1; [2025-03-16 15:22:44,256 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2025-03-16 15:22:44,257 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:22:44,282 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:22:44,282 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:22:44,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:22:44 BoogieIcfgContainer [2025-03-16 15:22:44,283 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:22:44,289 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:22:44,289 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:22:44,292 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:22:44,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:22:40" (1/3) ... [2025-03-16 15:22:44,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e10fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:22:44, skipping insertion in model container [2025-03-16 15:22:44,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:22:41" (2/3) ... [2025-03-16 15:22:44,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e10fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:22:44, skipping insertion in model container [2025-03-16 15:22:44,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:22:44" (3/3) ... [2025-03-16 15:22:44,294 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem18_label10.c [2025-03-16 15:22:44,305 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:22:44,306 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label10.c that has 1 procedures, 696 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:22:44,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:22:44,371 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;@497f3f40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:22:44,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:22:44,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 696 states, 694 states have (on average 1.9913544668587897) internal successors, (1382), 695 states have internal predecessors, (1382), 0 states have call successors, (0), 0 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-16 15:22:44,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 15:22:44,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:22:44,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:22:44,383 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:22:44,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:22:44,387 INFO L85 PathProgramCache]: Analyzing trace with hash 22885524, now seen corresponding path program 1 times [2025-03-16 15:22:44,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:22:44,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580313737] [2025-03-16 15:22:44,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:44,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:22:44,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 15:22:44,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 15:22:44,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:44,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:44,489 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-16 15:22:44,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:22:44,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580313737] [2025-03-16 15:22:44,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580313737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:22:44,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:22:44,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:22:44,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812475850] [2025-03-16 15:22:44,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:22:44,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:22:44,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:22:44,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:22:44,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:22:44,513 INFO L87 Difference]: Start difference. First operand has 696 states, 694 states have (on average 1.9913544668587897) internal successors, (1382), 695 states have internal predecessors, (1382), 0 states have call successors, (0), 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 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-16 15:22:44,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:22:44,578 INFO L93 Difference]: Finished difference Result 1391 states and 2763 transitions. [2025-03-16 15:22:44,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:22:44,580 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-03-16 15:22:44,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:22:44,592 INFO L225 Difference]: With dead ends: 1391 [2025-03-16 15:22:44,593 INFO L226 Difference]: Without dead ends: 693 [2025-03-16 15:22:44,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:22:44,598 INFO L435 NwaCegarLoop]: 1320 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:22:44,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:22:44,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-03-16 15:22:44,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2025-03-16 15:22:44,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 692 states have (on average 1.903179190751445) internal successors, (1317), 692 states have internal predecessors, (1317), 0 states have call successors, (0), 0 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-16 15:22:44,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1317 transitions. [2025-03-16 15:22:44,656 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1317 transitions. Word has length 17 [2025-03-16 15:22:44,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:22:44,656 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 1317 transitions. [2025-03-16 15:22:44,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-16 15:22:44,657 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1317 transitions. [2025-03-16 15:22:44,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 15:22:44,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:22:44,657 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:22:44,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:22:44,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:22:44,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:22:44,658 INFO L85 PathProgramCache]: Analyzing trace with hash 19439187, now seen corresponding path program 1 times [2025-03-16 15:22:44,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:22:44,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741030599] [2025-03-16 15:22:44,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:44,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:22:44,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 15:22:44,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 15:22:44,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:44,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:44,760 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-16 15:22:44,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:22:44,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741030599] [2025-03-16 15:22:44,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741030599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:22:44,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:22:44,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:22:44,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861464892] [2025-03-16 15:22:44,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:22:44,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:22:44,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:22:44,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:22:44,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:22:44,761 INFO L87 Difference]: Start difference. First operand 693 states and 1317 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-16 15:22:47,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:22:47,078 INFO L93 Difference]: Finished difference Result 2075 states and 3948 transitions. [2025-03-16 15:22:47,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:22:47,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-03-16 15:22:47,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:22:47,083 INFO L225 Difference]: With dead ends: 2075 [2025-03-16 15:22:47,084 INFO L226 Difference]: Without dead ends: 1383 [2025-03-16 15:22:47,085 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-16 15:22:47,085 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 758 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:22:47,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 436 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:22:47,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2025-03-16 15:22:47,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1383. [2025-03-16 15:22:47,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1382 states have (on average 1.5998552821997105) internal successors, (2211), 1382 states have internal predecessors, (2211), 0 states have call successors, (0), 0 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-16 15:22:47,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 2211 transitions. [2025-03-16 15:22:47,113 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 2211 transitions. Word has length 17 [2025-03-16 15:22:47,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:22:47,113 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 2211 transitions. [2025-03-16 15:22:47,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-16 15:22:47,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2211 transitions. [2025-03-16 15:22:47,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 15:22:47,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:22:47,115 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:22:47,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:22:47,115 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:22:47,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:22:47,116 INFO L85 PathProgramCache]: Analyzing trace with hash -561695162, now seen corresponding path program 1 times [2025-03-16 15:22:47,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:22:47,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073041701] [2025-03-16 15:22:47,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:47,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:22:47,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 15:22:47,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 15:22:47,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:47,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:47,341 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:22:47,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:22:47,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073041701] [2025-03-16 15:22:47,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073041701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:22:47,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:22:47,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:22:47,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20532818] [2025-03-16 15:22:47,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:22:47,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:22:47,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:22:47,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:22:47,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:22:47,345 INFO L87 Difference]: Start difference. First operand 1383 states and 2211 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-16 15:22:49,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:22:49,364 INFO L93 Difference]: Finished difference Result 4145 states and 6630 transitions. [2025-03-16 15:22:49,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:22:49,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2025-03-16 15:22:49,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:22:49,373 INFO L225 Difference]: With dead ends: 4145 [2025-03-16 15:22:49,373 INFO L226 Difference]: Without dead ends: 2763 [2025-03-16 15:22:49,375 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-16 15:22:49,375 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 714 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:22:49,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 528 Invalid, 2619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 15:22:49,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2025-03-16 15:22:49,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2763. [2025-03-16 15:22:49,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2763 states, 2762 states have (on average 1.3504706734250542) internal successors, (3730), 2762 states have internal predecessors, (3730), 0 states have call successors, (0), 0 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-16 15:22:49,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 3730 transitions. [2025-03-16 15:22:49,413 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 3730 transitions. Word has length 82 [2025-03-16 15:22:49,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:22:49,413 INFO L471 AbstractCegarLoop]: Abstraction has 2763 states and 3730 transitions. [2025-03-16 15:22:49,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-16 15:22:49,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 3730 transitions. [2025-03-16 15:22:49,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-16 15:22:49,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:22:49,415 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:22:49,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:22:49,416 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:22:49,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:22:49,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1472156790, now seen corresponding path program 1 times [2025-03-16 15:22:49,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:22:49,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824567574] [2025-03-16 15:22:49,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:49,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:22:49,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-16 15:22:49,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-16 15:22:49,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:49,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:49,920 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 15:22:49,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:22:49,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824567574] [2025-03-16 15:22:49,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824567574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:22:49,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:22:49,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:22:49,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656192240] [2025-03-16 15:22:49,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:22:49,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:22:49,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:22:49,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:22:49,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:22:49,923 INFO L87 Difference]: Start difference. First operand 2763 states and 3730 transitions. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 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-16 15:22:52,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:22:52,495 INFO L93 Difference]: Finished difference Result 7595 states and 9793 transitions. [2025-03-16 15:22:52,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:22:52,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2025-03-16 15:22:52,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:22:52,510 INFO L225 Difference]: With dead ends: 7595 [2025-03-16 15:22:52,510 INFO L226 Difference]: Without dead ends: 4833 [2025-03-16 15:22:52,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:22:52,516 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 1872 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4348 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1872 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 4465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 4348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:22:52,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1872 Valid, 640 Invalid, 4465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 4348 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 15:22:52,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4833 states. [2025-03-16 15:22:52,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4833 to 4143. [2025-03-16 15:22:52,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4143 states, 4142 states have (on average 1.269917914051183) internal successors, (5260), 4142 states have internal predecessors, (5260), 0 states have call successors, (0), 0 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-16 15:22:52,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 5260 transitions. [2025-03-16 15:22:52,583 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 5260 transitions. Word has length 200 [2025-03-16 15:22:52,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:22:52,585 INFO L471 AbstractCegarLoop]: Abstraction has 4143 states and 5260 transitions. [2025-03-16 15:22:52,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 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-16 15:22:52,585 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 5260 transitions. [2025-03-16 15:22:52,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-03-16 15:22:52,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:22:52,589 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:22:52,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:22:52,590 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:22:52,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:22:52,590 INFO L85 PathProgramCache]: Analyzing trace with hash -747052535, now seen corresponding path program 1 times [2025-03-16 15:22:52,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:22:52,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312124047] [2025-03-16 15:22:52,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:52,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:22:52,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-16 15:22:52,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-16 15:22:52,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:52,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:52,983 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:22:52,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:22:52,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312124047] [2025-03-16 15:22:52,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312124047] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:22:52,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291737415] [2025-03-16 15:22:52,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:52,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:22:52,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:22:52,988 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-16 15:22:52,990 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-16 15:22:53,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-16 15:22:53,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-16 15:22:53,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:53,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:53,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:22:53,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:22:53,178 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:22:53,178 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:22:53,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291737415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:22:53,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:22:53,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 15:22:53,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788982422] [2025-03-16 15:22:53,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:22:53,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:22:53,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:22:53,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:22:53,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:22:53,180 INFO L87 Difference]: Start difference. First operand 4143 states and 5260 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-16 15:22:54,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:22:54,866 INFO L93 Difference]: Finished difference Result 12425 states and 15777 transitions. [2025-03-16 15:22:54,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:22:54,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 316 [2025-03-16 15:22:54,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:22:54,884 INFO L225 Difference]: With dead ends: 12425 [2025-03-16 15:22:54,884 INFO L226 Difference]: Without dead ends: 8283 [2025-03-16 15:22:54,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:22:54,890 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 688 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2345 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 2791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 2345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:22:54,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 822 Invalid, 2791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 2345 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 15:22:54,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8283 states. [2025-03-16 15:22:54,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8283 to 8283. [2025-03-16 15:22:54,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8283 states, 8282 states have (on average 1.247283264911857) internal successors, (10330), 8282 states have internal predecessors, (10330), 0 states have call successors, (0), 0 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-16 15:22:55,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8283 states to 8283 states and 10330 transitions. [2025-03-16 15:22:55,000 INFO L78 Accepts]: Start accepts. Automaton has 8283 states and 10330 transitions. Word has length 316 [2025-03-16 15:22:55,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:22:55,003 INFO L471 AbstractCegarLoop]: Abstraction has 8283 states and 10330 transitions. [2025-03-16 15:22:55,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-16 15:22:55,005 INFO L276 IsEmpty]: Start isEmpty. Operand 8283 states and 10330 transitions. [2025-03-16 15:22:55,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-16 15:22:55,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:22:55,007 INFO L218 NwaCegarLoop]: trace histogram [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, 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-16 15:22:55,015 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-16 15:22:55,208 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-16 15:22:55,208 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:22:55,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:22:55,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1421113622, now seen corresponding path program 1 times [2025-03-16 15:22:55,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:22:55,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44966723] [2025-03-16 15:22:55,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:55,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:22:55,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-16 15:22:55,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-16 15:22:55,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:55,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:22:55,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:22:55,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44966723] [2025-03-16 15:22:55,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44966723] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:22:55,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260082632] [2025-03-16 15:22:55,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:55,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:22:55,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:22:55,569 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-16 15:22:55,571 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-16 15:22:55,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-16 15:22:55,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-16 15:22:55,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:55,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:55,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:22:55,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:22:55,966 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 15:22:55,967 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:22:55,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260082632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:22:55,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:22:55,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-16 15:22:55,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541062097] [2025-03-16 15:22:55,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:22:55,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:22:55,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:22:55,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:22:55,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:22:55,968 INFO L87 Difference]: Start difference. First operand 8283 states and 10330 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 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-16 15:22:57,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:22:57,777 INFO L93 Difference]: Finished difference Result 24155 states and 30159 transitions. [2025-03-16 15:22:57,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:22:57,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 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 323 [2025-03-16 15:22:57,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:22:57,821 INFO L225 Difference]: With dead ends: 24155 [2025-03-16 15:22:57,821 INFO L226 Difference]: Without dead ends: 15873 [2025-03-16 15:22:57,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:22:57,829 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 391 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2331 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 2788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 2331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:22:57,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 549 Invalid, 2788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 2331 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:22:57,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15873 states. [2025-03-16 15:22:57,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15873 to 12423. [2025-03-16 15:22:57,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12423 states, 12422 states have (on average 1.2310417002093061) internal successors, (15292), 12422 states have internal predecessors, (15292), 0 states have call successors, (0), 0 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-16 15:22:58,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12423 states to 12423 states and 15292 transitions. [2025-03-16 15:22:58,017 INFO L78 Accepts]: Start accepts. Automaton has 12423 states and 15292 transitions. Word has length 323 [2025-03-16 15:22:58,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:22:58,017 INFO L471 AbstractCegarLoop]: Abstraction has 12423 states and 15292 transitions. [2025-03-16 15:22:58,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 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-16 15:22:58,022 INFO L276 IsEmpty]: Start isEmpty. Operand 12423 states and 15292 transitions. [2025-03-16 15:22:58,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-03-16 15:22:58,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:22:58,027 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:22:58,034 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-16 15:22:58,228 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,SelfDestructingSolverStorable5 [2025-03-16 15:22:58,228 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:22:58,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:22:58,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1445635510, now seen corresponding path program 1 times [2025-03-16 15:22:58,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:22:58,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614591793] [2025-03-16 15:22:58,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:22:58,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:22:58,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-03-16 15:22:58,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-03-16 15:22:58,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:22:58,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:22:58,625 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:22:58,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:22:58,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614591793] [2025-03-16 15:22:58,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614591793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:22:58,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:22:58,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:22:58,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134358217] [2025-03-16 15:22:58,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:22:58,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:22:58,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:22:58,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:22:58,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:22:58,627 INFO L87 Difference]: Start difference. First operand 12423 states and 15292 transitions. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 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-16 15:23:00,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:00,350 INFO L93 Difference]: Finished difference Result 31055 states and 38077 transitions. [2025-03-16 15:23:00,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:00,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 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 409 [2025-03-16 15:23:00,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:00,379 INFO L225 Difference]: With dead ends: 31055 [2025-03-16 15:23:00,380 INFO L226 Difference]: Without dead ends: 18633 [2025-03-16 15:23:00,389 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-16 15:23:00,390 INFO L435 NwaCegarLoop]: 1069 mSDtfsCounter, 600 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2201 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 2555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 2201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:00,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 1075 Invalid, 2555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 2201 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 15:23:00,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18633 states. [2025-03-16 15:23:00,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18633 to 17943. [2025-03-16 15:23:00,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17943 states, 17942 states have (on average 1.1940697804035225) internal successors, (21424), 17942 states have internal predecessors, (21424), 0 states have call successors, (0), 0 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-16 15:23:00,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17943 states to 17943 states and 21424 transitions. [2025-03-16 15:23:00,563 INFO L78 Accepts]: Start accepts. Automaton has 17943 states and 21424 transitions. Word has length 409 [2025-03-16 15:23:00,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:00,564 INFO L471 AbstractCegarLoop]: Abstraction has 17943 states and 21424 transitions. [2025-03-16 15:23:00,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 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-16 15:23:00,564 INFO L276 IsEmpty]: Start isEmpty. Operand 17943 states and 21424 transitions. [2025-03-16 15:23:00,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-03-16 15:23:00,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:00,569 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:23:00,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:23:00,569 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:00,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:00,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1960539019, now seen corresponding path program 1 times [2025-03-16 15:23:00,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:00,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337752149] [2025-03-16 15:23:00,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:00,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:00,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-16 15:23:00,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-16 15:23:00,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:00,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:00,818 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-16 15:23:00,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:00,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337752149] [2025-03-16 15:23:00,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337752149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:00,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:00,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:23:00,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755785027] [2025-03-16 15:23:00,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:00,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:00,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:00,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:00,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:00,822 INFO L87 Difference]: Start difference. First operand 17943 states and 21424 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 2 states have internal predecessors, (318), 0 states have call successors, (0), 0 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-16 15:23:02,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:02,505 INFO L93 Difference]: Finished difference Result 42785 states and 50791 transitions. [2025-03-16 15:23:02,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:02,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 2 states have internal predecessors, (318), 0 states have call successors, (0), 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 414 [2025-03-16 15:23:02,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:02,543 INFO L225 Difference]: With dead ends: 42785 [2025-03-16 15:23:02,544 INFO L226 Difference]: Without dead ends: 24843 [2025-03-16 15:23:02,561 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-16 15:23:02,562 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 499 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1934 mSolverCounterSat, 746 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 2680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 746 IncrementalHoareTripleChecker+Valid, 1934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:02,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 108 Invalid, 2680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [746 Valid, 1934 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:23:02,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24843 states. [2025-03-16 15:23:02,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24843 to 24843. [2025-03-16 15:23:02,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24843 states, 24842 states have (on average 1.150309958940504) internal successors, (28576), 24842 states have internal predecessors, (28576), 0 states have call successors, (0), 0 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-16 15:23:02,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24843 states to 24843 states and 28576 transitions. [2025-03-16 15:23:02,861 INFO L78 Accepts]: Start accepts. Automaton has 24843 states and 28576 transitions. Word has length 414 [2025-03-16 15:23:02,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:02,862 INFO L471 AbstractCegarLoop]: Abstraction has 24843 states and 28576 transitions. [2025-03-16 15:23:02,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 2 states have internal predecessors, (318), 0 states have call successors, (0), 0 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-16 15:23:02,862 INFO L276 IsEmpty]: Start isEmpty. Operand 24843 states and 28576 transitions. [2025-03-16 15:23:02,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2025-03-16 15:23:02,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:02,868 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:23:02,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:23:02,868 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:02,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:02,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1145214217, now seen corresponding path program 1 times [2025-03-16 15:23:02,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:02,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468666080] [2025-03-16 15:23:02,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:02,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:02,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-03-16 15:23:02,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-03-16 15:23:02,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:02,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:03,015 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-16 15:23:03,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:03,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468666080] [2025-03-16 15:23:03,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468666080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:03,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:03,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:03,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758910748] [2025-03-16 15:23:03,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:03,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:03,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:03,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:03,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:03,018 INFO L87 Difference]: Start difference. First operand 24843 states and 28576 transitions. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 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-16 15:23:04,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:04,926 INFO L93 Difference]: Finished difference Result 53825 states and 62397 transitions. [2025-03-16 15:23:04,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:04,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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 416 [2025-03-16 15:23:04,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:04,966 INFO L225 Difference]: With dead ends: 53825 [2025-03-16 15:23:04,966 INFO L226 Difference]: Without dead ends: 28983 [2025-03-16 15:23:04,983 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-16 15:23:04,983 INFO L435 NwaCegarLoop]: 1291 mSDtfsCounter, 686 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1958 mSolverCounterSat, 755 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 2713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 755 IncrementalHoareTripleChecker+Valid, 1958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:04,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 1297 Invalid, 2713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [755 Valid, 1958 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:23:05,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28983 states. [2025-03-16 15:23:05,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28983 to 27603. [2025-03-16 15:23:05,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27603 states, 27602 states have (on average 1.1433229476124918) internal successors, (31558), 27602 states have internal predecessors, (31558), 0 states have call successors, (0), 0 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-16 15:23:05,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27603 states to 27603 states and 31558 transitions. [2025-03-16 15:23:05,225 INFO L78 Accepts]: Start accepts. Automaton has 27603 states and 31558 transitions. Word has length 416 [2025-03-16 15:23:05,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:05,225 INFO L471 AbstractCegarLoop]: Abstraction has 27603 states and 31558 transitions. [2025-03-16 15:23:05,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 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-16 15:23:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 27603 states and 31558 transitions. [2025-03-16 15:23:05,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-03-16 15:23:05,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:05,229 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:23:05,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:23:05,230 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:05,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:05,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1159969308, now seen corresponding path program 1 times [2025-03-16 15:23:05,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:05,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552434943] [2025-03-16 15:23:05,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:05,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:05,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-16 15:23:05,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-16 15:23:05,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:05,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:05,468 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-03-16 15:23:05,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:05,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552434943] [2025-03-16 15:23:05,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552434943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:05,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:05,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:05,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015772800] [2025-03-16 15:23:05,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:05,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:05,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:05,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:05,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:05,470 INFO L87 Difference]: Start difference. First operand 27603 states and 31558 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:07,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:07,351 INFO L93 Difference]: Finished difference Result 64175 states and 74121 transitions. [2025-03-16 15:23:07,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:07,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 506 [2025-03-16 15:23:07,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:07,389 INFO L225 Difference]: With dead ends: 64175 [2025-03-16 15:23:07,389 INFO L226 Difference]: Without dead ends: 33123 [2025-03-16 15:23:07,407 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-16 15:23:07,407 INFO L435 NwaCegarLoop]: 1310 mSDtfsCounter, 676 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2146 mSolverCounterSat, 473 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 473 IncrementalHoareTripleChecker+Valid, 2146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:07,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1316 Invalid, 2619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [473 Valid, 2146 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:23:07,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33123 states. [2025-03-16 15:23:07,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33123 to 32433. [2025-03-16 15:23:07,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32433 states, 32432 states have (on average 1.134157622101628) internal successors, (36783), 32432 states have internal predecessors, (36783), 0 states have call successors, (0), 0 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-16 15:23:07,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32433 states to 32433 states and 36783 transitions. [2025-03-16 15:23:07,718 INFO L78 Accepts]: Start accepts. Automaton has 32433 states and 36783 transitions. Word has length 506 [2025-03-16 15:23:07,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:07,720 INFO L471 AbstractCegarLoop]: Abstraction has 32433 states and 36783 transitions. [2025-03-16 15:23:07,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:07,720 INFO L276 IsEmpty]: Start isEmpty. Operand 32433 states and 36783 transitions. [2025-03-16 15:23:07,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-03-16 15:23:07,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:07,725 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-16 15:23:07,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:23:07,725 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:07,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:07,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1988310337, now seen corresponding path program 1 times [2025-03-16 15:23:07,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:07,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548790454] [2025-03-16 15:23:07,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:07,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:07,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-16 15:23:07,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-16 15:23:07,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:07,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:08,036 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-16 15:23:08,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:08,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548790454] [2025-03-16 15:23:08,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548790454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:08,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:08,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:08,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512204129] [2025-03-16 15:23:08,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:08,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:23:08,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:08,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:23:08,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:23:08,039 INFO L87 Difference]: Start difference. First operand 32433 states and 36783 transitions. Second operand has 4 states, 4 states have (on average 94.5) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:09,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:09,738 INFO L93 Difference]: Finished difference Result 66298 states and 75022 transitions. [2025-03-16 15:23:09,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:23:09,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 527 [2025-03-16 15:23:09,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:09,777 INFO L225 Difference]: With dead ends: 66298 [2025-03-16 15:23:09,777 INFO L226 Difference]: Without dead ends: 34503 [2025-03-16 15:23:09,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:23:09,800 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 529 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2579 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 2959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 2579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:09,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 624 Invalid, 2959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 2579 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:23:09,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34503 states. [2025-03-16 15:23:10,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34503 to 34503. [2025-03-16 15:23:10,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34503 states, 34502 states have (on average 1.0967190307808243) internal successors, (37839), 34502 states have internal predecessors, (37839), 0 states have call successors, (0), 0 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-16 15:23:10,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34503 states to 34503 states and 37839 transitions. [2025-03-16 15:23:10,152 INFO L78 Accepts]: Start accepts. Automaton has 34503 states and 37839 transitions. Word has length 527 [2025-03-16 15:23:10,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:10,153 INFO L471 AbstractCegarLoop]: Abstraction has 34503 states and 37839 transitions. [2025-03-16 15:23:10,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:10,153 INFO L276 IsEmpty]: Start isEmpty. Operand 34503 states and 37839 transitions. [2025-03-16 15:23:10,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2025-03-16 15:23:10,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:10,158 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:23:10,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:23:10,159 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:10,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:10,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1282223871, now seen corresponding path program 1 times [2025-03-16 15:23:10,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:10,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331616612] [2025-03-16 15:23:10,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:10,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:10,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 582 statements into 1 equivalence classes. [2025-03-16 15:23:10,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 582 of 582 statements. [2025-03-16 15:23:10,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:10,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:10,583 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 406 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 15:23:10,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:10,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331616612] [2025-03-16 15:23:10,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331616612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:10,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:10,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:10,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533267132] [2025-03-16 15:23:10,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:10,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:23:10,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:10,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:23:10,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:23:10,586 INFO L87 Difference]: Start difference. First operand 34503 states and 37839 transitions. Second operand has 4 states, 4 states have (on average 141.75) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 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-16 15:23:12,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:12,967 INFO L93 Difference]: Finished difference Result 69005 states and 75702 transitions. [2025-03-16 15:23:12,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:23:12,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 141.75) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 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 582 [2025-03-16 15:23:12,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:12,998 INFO L225 Difference]: With dead ends: 69005 [2025-03-16 15:23:12,998 INFO L226 Difference]: Without dead ends: 35193 [2025-03-16 15:23:13,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:23:13,010 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 1030 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3096 mSolverCounterSat, 675 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 3771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 675 IncrementalHoareTripleChecker+Valid, 3096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:13,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 96 Invalid, 3771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [675 Valid, 3096 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:23:13,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35193 states. [2025-03-16 15:23:13,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35193 to 35193. [2025-03-16 15:23:13,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35193 states, 35192 states have (on average 1.0784837463059787) internal successors, (37954), 35192 states have internal predecessors, (37954), 0 states have call successors, (0), 0 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-16 15:23:13,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35193 states to 35193 states and 37954 transitions. [2025-03-16 15:23:13,376 INFO L78 Accepts]: Start accepts. Automaton has 35193 states and 37954 transitions. Word has length 582 [2025-03-16 15:23:13,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:13,377 INFO L471 AbstractCegarLoop]: Abstraction has 35193 states and 37954 transitions. [2025-03-16 15:23:13,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 141.75) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 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-16 15:23:13,380 INFO L276 IsEmpty]: Start isEmpty. Operand 35193 states and 37954 transitions. [2025-03-16 15:23:13,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1103 [2025-03-16 15:23:13,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:13,402 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:23:13,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:23:13,402 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:13,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:13,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1619220075, now seen corresponding path program 1 times [2025-03-16 15:23:13,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:13,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507236837] [2025-03-16 15:23:13,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:13,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:13,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1102 statements into 1 equivalence classes. [2025-03-16 15:23:13,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1102 of 1102 statements. [2025-03-16 15:23:13,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:13,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:14,473 INFO L134 CoverageAnalysis]: Checked inductivity of 886 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 839 trivial. 0 not checked. [2025-03-16 15:23:14,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:14,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507236837] [2025-03-16 15:23:14,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507236837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:14,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:14,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:14,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530442737] [2025-03-16 15:23:14,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:14,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:14,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:14,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:14,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:14,475 INFO L87 Difference]: Start difference. First operand 35193 states and 37954 transitions. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 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-16 15:23:15,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:15,853 INFO L93 Difference]: Finished difference Result 69695 states and 75216 transitions. [2025-03-16 15:23:15,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:15,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 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 1102 [2025-03-16 15:23:15,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:15,886 INFO L225 Difference]: With dead ends: 69695 [2025-03-16 15:23:15,886 INFO L226 Difference]: Without dead ends: 35193 [2025-03-16 15:23:15,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-16 15:23:15,900 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 779 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1952 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 2143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:15,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 778 Invalid, 2143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1952 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:23:15,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35193 states. [2025-03-16 15:23:16,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35193 to 35193. [2025-03-16 15:23:16,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35193 states, 35192 states have (on average 1.0673732666515117) internal successors, (37563), 35192 states have internal predecessors, (37563), 0 states have call successors, (0), 0 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-16 15:23:16,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35193 states to 35193 states and 37563 transitions. [2025-03-16 15:23:16,156 INFO L78 Accepts]: Start accepts. Automaton has 35193 states and 37563 transitions. Word has length 1102 [2025-03-16 15:23:16,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:16,156 INFO L471 AbstractCegarLoop]: Abstraction has 35193 states and 37563 transitions. [2025-03-16 15:23:16,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 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-16 15:23:16,157 INFO L276 IsEmpty]: Start isEmpty. Operand 35193 states and 37563 transitions. [2025-03-16 15:23:16,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1465 [2025-03-16 15:23:16,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:16,181 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:23:16,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:23:16,181 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:16,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:16,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1537269766, now seen corresponding path program 1 times [2025-03-16 15:23:16,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:16,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583315438] [2025-03-16 15:23:16,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:16,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:16,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1464 statements into 1 equivalence classes. [2025-03-16 15:23:16,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1464 of 1464 statements. [2025-03-16 15:23:16,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:16,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:16,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 1010 proven. 0 refuted. 0 times theorem prover too weak. 790 trivial. 0 not checked. [2025-03-16 15:23:16,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:16,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583315438] [2025-03-16 15:23:16,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583315438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:16,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:16,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:16,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976008679] [2025-03-16 15:23:16,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:16,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:16,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:16,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:16,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:16,868 INFO L87 Difference]: Start difference. First operand 35193 states and 37563 transitions. Second operand has 3 states, 3 states have (on average 321.6666666666667) internal successors, (965), 3 states have internal predecessors, (965), 0 states have call successors, (0), 0 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-16 15:23:18,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:18,290 INFO L93 Difference]: Finished difference Result 80045 states and 86040 transitions. [2025-03-16 15:23:18,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:18,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 321.6666666666667) internal successors, (965), 3 states have internal predecessors, (965), 0 states have call successors, (0), 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 1464 [2025-03-16 15:23:18,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:18,338 INFO L225 Difference]: With dead ends: 80045 [2025-03-16 15:23:18,338 INFO L226 Difference]: Without dead ends: 45543 [2025-03-16 15:23:18,361 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-16 15:23:18,361 INFO L435 NwaCegarLoop]: 965 mSDtfsCounter, 289 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1992 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 2202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:18,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 971 Invalid, 2202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1992 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:23:18,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45543 states. [2025-03-16 15:23:18,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45543 to 44853. [2025-03-16 15:23:18,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44853 states, 44852 states have (on average 1.0645233211450995) internal successors, (47746), 44852 states have internal predecessors, (47746), 0 states have call successors, (0), 0 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-16 15:23:18,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44853 states to 44853 states and 47746 transitions. [2025-03-16 15:23:18,826 INFO L78 Accepts]: Start accepts. Automaton has 44853 states and 47746 transitions. Word has length 1464 [2025-03-16 15:23:18,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:18,827 INFO L471 AbstractCegarLoop]: Abstraction has 44853 states and 47746 transitions. [2025-03-16 15:23:18,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 321.6666666666667) internal successors, (965), 3 states have internal predecessors, (965), 0 states have call successors, (0), 0 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-16 15:23:18,827 INFO L276 IsEmpty]: Start isEmpty. Operand 44853 states and 47746 transitions. [2025-03-16 15:23:18,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1483 [2025-03-16 15:23:18,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:18,866 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:23:18,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:23:18,866 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:18,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:18,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1736847333, now seen corresponding path program 1 times [2025-03-16 15:23:18,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:18,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126638554] [2025-03-16 15:23:18,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:18,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:18,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1482 statements into 1 equivalence classes. [2025-03-16 15:23:19,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1482 of 1482 statements. [2025-03-16 15:23:19,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:19,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:20,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1986 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 1889 trivial. 0 not checked. [2025-03-16 15:23:20,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:20,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126638554] [2025-03-16 15:23:20,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126638554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:20,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:20,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:20,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777475051] [2025-03-16 15:23:20,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:20,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:20,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:20,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:20,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:20,467 INFO L87 Difference]: Start difference. First operand 44853 states and 47746 transitions. Second operand has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 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-16 15:23:21,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:21,969 INFO L93 Difference]: Finished difference Result 102125 states and 109328 transitions. [2025-03-16 15:23:21,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:21,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 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 1482 [2025-03-16 15:23:21,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:22,119 INFO L225 Difference]: With dead ends: 102125 [2025-03-16 15:23:22,119 INFO L226 Difference]: Without dead ends: 57963 [2025-03-16 15:23:22,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-16 15:23:22,130 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 693 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2067 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 2380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 2067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:22,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 295 Invalid, 2380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 2067 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:23:22,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57963 states. [2025-03-16 15:23:22,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57963 to 52443. [2025-03-16 15:23:22,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52443 states, 52442 states have (on average 1.0739674306853286) internal successors, (56321), 52442 states have internal predecessors, (56321), 0 states have call successors, (0), 0 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-16 15:23:22,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52443 states to 52443 states and 56321 transitions. [2025-03-16 15:23:22,486 INFO L78 Accepts]: Start accepts. Automaton has 52443 states and 56321 transitions. Word has length 1482 [2025-03-16 15:23:22,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:22,487 INFO L471 AbstractCegarLoop]: Abstraction has 52443 states and 56321 transitions. [2025-03-16 15:23:22,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 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-16 15:23:22,487 INFO L276 IsEmpty]: Start isEmpty. Operand 52443 states and 56321 transitions. [2025-03-16 15:23:22,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1642 [2025-03-16 15:23:22,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:22,521 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:23:22,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:23:22,521 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:22,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:22,522 INFO L85 PathProgramCache]: Analyzing trace with hash 156102794, now seen corresponding path program 1 times [2025-03-16 15:23:22,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:22,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252683507] [2025-03-16 15:23:22,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:22,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:22,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1641 statements into 1 equivalence classes. [2025-03-16 15:23:22,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1641 of 1641 statements. [2025-03-16 15:23:22,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:22,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:23,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2251 backedges. 1445 proven. 0 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked. [2025-03-16 15:23:23,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:23,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252683507] [2025-03-16 15:23:23,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252683507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:23,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:23,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:23,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480043710] [2025-03-16 15:23:23,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:23,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:23,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:23,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:23,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:23,301 INFO L87 Difference]: Start difference. First operand 52443 states and 56321 transitions. Second operand has 3 states, 3 states have (on average 375.6666666666667) internal successors, (1127), 3 states have internal predecessors, (1127), 0 states have call successors, (0), 0 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-16 15:23:24,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:24,762 INFO L93 Difference]: Finished difference Result 109025 states and 116865 transitions. [2025-03-16 15:23:24,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:24,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 375.6666666666667) internal successors, (1127), 3 states have internal predecessors, (1127), 0 states have call successors, (0), 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 1641 [2025-03-16 15:23:24,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:24,816 INFO L225 Difference]: With dead ends: 109025 [2025-03-16 15:23:24,816 INFO L226 Difference]: Without dead ends: 52443 [2025-03-16 15:23:24,848 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-16 15:23:24,849 INFO L435 NwaCegarLoop]: 1045 mSDtfsCounter, 652 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 2160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 486 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:24,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 1050 Invalid, 2160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [486 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:23:24,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52443 states. [2025-03-16 15:23:25,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52443 to 50373. [2025-03-16 15:23:25,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50373 states, 50372 states have (on average 1.0337886127213531) internal successors, (52074), 50372 states have internal predecessors, (52074), 0 states have call successors, (0), 0 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-16 15:23:25,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50373 states to 50373 states and 52074 transitions. [2025-03-16 15:23:25,208 INFO L78 Accepts]: Start accepts. Automaton has 50373 states and 52074 transitions. Word has length 1641 [2025-03-16 15:23:25,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:25,209 INFO L471 AbstractCegarLoop]: Abstraction has 50373 states and 52074 transitions. [2025-03-16 15:23:25,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.6666666666667) internal successors, (1127), 3 states have internal predecessors, (1127), 0 states have call successors, (0), 0 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-16 15:23:25,209 INFO L276 IsEmpty]: Start isEmpty. Operand 50373 states and 52074 transitions. [2025-03-16 15:23:25,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1778 [2025-03-16 15:23:25,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:25,244 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:23:25,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:23:25,244 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:25,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:25,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1074098481, now seen corresponding path program 1 times [2025-03-16 15:23:25,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:25,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423787143] [2025-03-16 15:23:25,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:25,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:25,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1777 statements into 1 equivalence classes. [2025-03-16 15:23:25,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1777 of 1777 statements. [2025-03-16 15:23:25,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:25,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:26,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2689 backedges. 1950 proven. 0 refuted. 0 times theorem prover too weak. 739 trivial. 0 not checked. [2025-03-16 15:23:26,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:26,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423787143] [2025-03-16 15:23:26,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423787143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:26,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:26,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:26,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385045147] [2025-03-16 15:23:26,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:26,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:26,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:26,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:26,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:26,355 INFO L87 Difference]: Start difference. First operand 50373 states and 52074 transitions. Second operand has 3 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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-16 15:23:27,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:27,825 INFO L93 Difference]: Finished difference Result 109715 states and 113683 transitions. [2025-03-16 15:23:27,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:27,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 0 states have call successors, (0), 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 1777 [2025-03-16 15:23:27,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:27,893 INFO L225 Difference]: With dead ends: 109715 [2025-03-16 15:23:27,893 INFO L226 Difference]: Without dead ends: 60033 [2025-03-16 15:23:27,931 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-16 15:23:27,932 INFO L435 NwaCegarLoop]: 935 mSDtfsCounter, 456 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:27,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 941 Invalid, 1936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:23:27,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60033 states. [2025-03-16 15:23:28,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60033 to 60033. [2025-03-16 15:23:28,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60033 states, 60032 states have (on average 1.0326492537313432) internal successors, (61992), 60032 states have internal predecessors, (61992), 0 states have call successors, (0), 0 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-16 15:23:28,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60033 states to 60033 states and 61992 transitions. [2025-03-16 15:23:28,520 INFO L78 Accepts]: Start accepts. Automaton has 60033 states and 61992 transitions. Word has length 1777 [2025-03-16 15:23:28,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:28,520 INFO L471 AbstractCegarLoop]: Abstraction has 60033 states and 61992 transitions. [2025-03-16 15:23:28,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 0 states have call successors, (0), 0 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-16 15:23:28,521 INFO L276 IsEmpty]: Start isEmpty. Operand 60033 states and 61992 transitions. [2025-03-16 15:23:28,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1886 [2025-03-16 15:23:28,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:28,559 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 15:23:28,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:23:28,560 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:28,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:28,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1242487386, now seen corresponding path program 1 times [2025-03-16 15:23:28,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:28,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572100991] [2025-03-16 15:23:28,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:28,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:28,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1885 statements into 1 equivalence classes. [2025-03-16 15:23:28,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1885 of 1885 statements. [2025-03-16 15:23:28,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:28,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:31,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3399 backedges. 1442 proven. 0 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked. [2025-03-16 15:23:31,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:31,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572100991] [2025-03-16 15:23:31,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572100991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:31,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:31,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 15:23:31,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648325057] [2025-03-16 15:23:31,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:31,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 15:23:31,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:31,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 15:23:31,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:23:31,139 INFO L87 Difference]: Start difference. First operand 60033 states and 61992 transitions. Second operand has 9 states, 9 states have (on average 119.33333333333333) internal successors, (1074), 9 states have internal predecessors, (1074), 0 states have call successors, (0), 0 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-16 15:23:35,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:35,659 INFO L93 Difference]: Finished difference Result 135853 states and 140302 transitions. [2025-03-16 15:23:35,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 15:23:35,660 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 119.33333333333333) internal successors, (1074), 9 states have internal predecessors, (1074), 0 states have call successors, (0), 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 1885 [2025-03-16 15:23:35,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:35,733 INFO L225 Difference]: With dead ends: 135853 [2025-03-16 15:23:35,733 INFO L226 Difference]: Without dead ends: 76511 [2025-03-16 15:23:35,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2025-03-16 15:23:35,767 INFO L435 NwaCegarLoop]: 1370 mSDtfsCounter, 1712 mSDsluCounter, 1813 mSDsCounter, 0 mSdLazyCounter, 10624 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1712 SdHoareTripleChecker+Valid, 3183 SdHoareTripleChecker+Invalid, 10755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 10624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:35,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1712 Valid, 3183 Invalid, 10755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 10624 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-16 15:23:35,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76511 states. [2025-03-16 15:23:36,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76511 to 60033. [2025-03-16 15:23:36,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60033 states, 60032 states have (on average 1.0313166311300639) internal successors, (61912), 60032 states have internal predecessors, (61912), 0 states have call successors, (0), 0 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-16 15:23:36,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60033 states to 60033 states and 61912 transitions. [2025-03-16 15:23:36,250 INFO L78 Accepts]: Start accepts. Automaton has 60033 states and 61912 transitions. Word has length 1885 [2025-03-16 15:23:36,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:36,251 INFO L471 AbstractCegarLoop]: Abstraction has 60033 states and 61912 transitions. [2025-03-16 15:23:36,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 119.33333333333333) internal successors, (1074), 9 states have internal predecessors, (1074), 0 states have call successors, (0), 0 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-16 15:23:36,251 INFO L276 IsEmpty]: Start isEmpty. Operand 60033 states and 61912 transitions. [2025-03-16 15:23:36,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1901 [2025-03-16 15:23:36,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:36,287 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 15:23:36,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:23:36,288 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:36,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:36,288 INFO L85 PathProgramCache]: Analyzing trace with hash 242629430, now seen corresponding path program 1 times [2025-03-16 15:23:36,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:36,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816278872] [2025-03-16 15:23:36,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:36,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:36,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1900 statements into 1 equivalence classes. [2025-03-16 15:23:36,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1900 of 1900 statements. [2025-03-16 15:23:36,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:36,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:37,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4016 backedges. 2691 proven. 0 refuted. 0 times theorem prover too weak. 1325 trivial. 0 not checked. [2025-03-16 15:23:37,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:37,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816278872] [2025-03-16 15:23:37,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816278872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:37,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:37,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:37,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619270163] [2025-03-16 15:23:37,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:37,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:37,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:37,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:37,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:37,126 INFO L87 Difference]: Start difference. First operand 60033 states and 61912 transitions. Second operand has 3 states, 3 states have (on average 389.0) internal successors, (1167), 3 states have internal predecessors, (1167), 0 states have call successors, (0), 0 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-16 15:23:38,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:38,356 INFO L93 Difference]: Finished difference Result 120065 states and 123823 transitions. [2025-03-16 15:23:38,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:38,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 389.0) internal successors, (1167), 3 states have internal predecessors, (1167), 0 states have call successors, (0), 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 1900 [2025-03-16 15:23:38,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:38,416 INFO L225 Difference]: With dead ends: 120065 [2025-03-16 15:23:38,416 INFO L226 Difference]: Without dead ends: 60723 [2025-03-16 15:23:38,447 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-16 15:23:38,448 INFO L435 NwaCegarLoop]: 935 mSDtfsCounter, 587 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:38,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 941 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1676 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:23:38,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60723 states. [2025-03-16 15:23:38,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60723 to 60033. [2025-03-16 15:23:38,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60033 states, 60032 states have (on average 1.029534248400853) internal successors, (61805), 60032 states have internal predecessors, (61805), 0 states have call successors, (0), 0 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-16 15:23:38,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60033 states to 60033 states and 61805 transitions. [2025-03-16 15:23:38,871 INFO L78 Accepts]: Start accepts. Automaton has 60033 states and 61805 transitions. Word has length 1900 [2025-03-16 15:23:38,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:38,872 INFO L471 AbstractCegarLoop]: Abstraction has 60033 states and 61805 transitions. [2025-03-16 15:23:38,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.0) internal successors, (1167), 3 states have internal predecessors, (1167), 0 states have call successors, (0), 0 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-16 15:23:38,872 INFO L276 IsEmpty]: Start isEmpty. Operand 60033 states and 61805 transitions. [2025-03-16 15:23:38,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1921 [2025-03-16 15:23:38,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:38,909 INFO L218 NwaCegarLoop]: trace histogram [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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 15:23:38,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:23:38,909 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:38,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:38,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1744879155, now seen corresponding path program 1 times [2025-03-16 15:23:38,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:38,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956678967] [2025-03-16 15:23:38,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:38,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:38,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1920 statements into 1 equivalence classes. [2025-03-16 15:23:39,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1920 of 1920 statements. [2025-03-16 15:23:39,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:39,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 1479 proven. 0 refuted. 0 times theorem prover too weak. 1791 trivial. 0 not checked. [2025-03-16 15:23:40,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:40,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956678967] [2025-03-16 15:23:40,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956678967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:40,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:40,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:40,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835426785] [2025-03-16 15:23:40,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:40,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:40,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:40,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:40,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:40,334 INFO L87 Difference]: Start difference. First operand 60033 states and 61805 transitions. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 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-16 15:23:41,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:41,727 INFO L93 Difference]: Finished difference Result 129725 states and 133708 transitions. [2025-03-16 15:23:41,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:41,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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 1920 [2025-03-16 15:23:41,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:41,790 INFO L225 Difference]: With dead ends: 129725 [2025-03-16 15:23:41,790 INFO L226 Difference]: Without dead ends: 70383 [2025-03-16 15:23:41,814 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-16 15:23:41,814 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 163 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:41,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 262 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1735 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:23:41,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70383 states. [2025-03-16 15:23:42,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70383 to 60723. [2025-03-16 15:23:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60723 states, 60722 states have (on average 1.0293468594578572) internal successors, (62504), 60722 states have internal predecessors, (62504), 0 states have call successors, (0), 0 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-16 15:23:42,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60723 states to 60723 states and 62504 transitions. [2025-03-16 15:23:42,453 INFO L78 Accepts]: Start accepts. Automaton has 60723 states and 62504 transitions. Word has length 1920 [2025-03-16 15:23:42,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:42,454 INFO L471 AbstractCegarLoop]: Abstraction has 60723 states and 62504 transitions. [2025-03-16 15:23:42,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 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-16 15:23:42,454 INFO L276 IsEmpty]: Start isEmpty. Operand 60723 states and 62504 transitions. [2025-03-16 15:23:42,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1930 [2025-03-16 15:23:42,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:42,525 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:23:42,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 15:23:42,526 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:42,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:42,527 INFO L85 PathProgramCache]: Analyzing trace with hash 513533537, now seen corresponding path program 1 times [2025-03-16 15:23:42,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:42,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671178718] [2025-03-16 15:23:42,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:42,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:42,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1929 statements into 1 equivalence classes. [2025-03-16 15:23:42,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1929 of 1929 statements. [2025-03-16 15:23:42,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:42,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:46,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3092 backedges. 1472 proven. 0 refuted. 0 times theorem prover too weak. 1620 trivial. 0 not checked. [2025-03-16 15:23:46,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:46,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671178718] [2025-03-16 15:23:46,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671178718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:46,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:46,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 15:23:46,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741996555] [2025-03-16 15:23:46,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:46,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 15:23:46,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:46,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 15:23:46,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:23:46,862 INFO L87 Difference]: Start difference. First operand 60723 states and 62504 transitions. Second operand has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 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-16 15:23:49,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:49,443 INFO L93 Difference]: Finished difference Result 131229 states and 134982 transitions. [2025-03-16 15:23:49,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 15:23:49,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 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 1929 [2025-03-16 15:23:49,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:49,510 INFO L225 Difference]: With dead ends: 131229 [2025-03-16 15:23:49,510 INFO L226 Difference]: Without dead ends: 68437 [2025-03-16 15:23:49,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:23:49,545 INFO L435 NwaCegarLoop]: 769 mSDtfsCounter, 1992 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 5209 mSolverCounterSat, 570 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1992 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 5779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 570 IncrementalHoareTripleChecker+Valid, 5209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:49,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1992 Valid, 790 Invalid, 5779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [570 Valid, 5209 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 15:23:49,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68437 states. [2025-03-16 15:23:49,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68437 to 60723. [2025-03-16 15:23:49,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60723 states, 60722 states have (on average 1.0263001877408517) internal successors, (62319), 60722 states have internal predecessors, (62319), 0 states have call successors, (0), 0 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-16 15:23:50,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60723 states to 60723 states and 62319 transitions. [2025-03-16 15:23:50,012 INFO L78 Accepts]: Start accepts. Automaton has 60723 states and 62319 transitions. Word has length 1929 [2025-03-16 15:23:50,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:50,013 INFO L471 AbstractCegarLoop]: Abstraction has 60723 states and 62319 transitions. [2025-03-16 15:23:50,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 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-16 15:23:50,013 INFO L276 IsEmpty]: Start isEmpty. Operand 60723 states and 62319 transitions. [2025-03-16 15:23:50,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1948 [2025-03-16 15:23:50,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:50,052 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 15:23:50,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 15:23:50,052 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:50,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:50,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1798889403, now seen corresponding path program 1 times [2025-03-16 15:23:50,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:50,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000534029] [2025-03-16 15:23:50,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:50,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:50,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1947 statements into 1 equivalence classes. [2025-03-16 15:23:50,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1947 of 1947 statements. [2025-03-16 15:23:50,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:50,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:50,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3951 backedges. 2646 proven. 0 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2025-03-16 15:23:50,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:50,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000534029] [2025-03-16 15:23:50,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000534029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:50,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:50,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:50,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893812284] [2025-03-16 15:23:50,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:50,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:50,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:50,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:50,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:50,876 INFO L87 Difference]: Start difference. First operand 60723 states and 62319 transitions. Second operand has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 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-16 15:23:52,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:52,474 INFO L93 Difference]: Finished difference Result 144905 states and 148951 transitions. [2025-03-16 15:23:52,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:52,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 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 1947 [2025-03-16 15:23:52,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:52,558 INFO L225 Difference]: With dead ends: 144905 [2025-03-16 15:23:52,559 INFO L226 Difference]: Without dead ends: 84873 [2025-03-16 15:23:52,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:52,597 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 551 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1684 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 1684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:52,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 880 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 1684 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:23:52,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84873 states. [2025-03-16 15:23:53,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84873 to 83493. [2025-03-16 15:23:53,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83493 states, 83492 states have (on average 1.0243376610932784) internal successors, (85524), 83492 states have internal predecessors, (85524), 0 states have call successors, (0), 0 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-16 15:23:53,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83493 states to 83493 states and 85524 transitions. [2025-03-16 15:23:53,418 INFO L78 Accepts]: Start accepts. Automaton has 83493 states and 85524 transitions. Word has length 1947 [2025-03-16 15:23:53,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:53,419 INFO L471 AbstractCegarLoop]: Abstraction has 83493 states and 85524 transitions. [2025-03-16 15:23:53,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 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-16 15:23:53,419 INFO L276 IsEmpty]: Start isEmpty. Operand 83493 states and 85524 transitions. [2025-03-16 15:23:53,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1992 [2025-03-16 15:23:53,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:53,510 INFO L218 NwaCegarLoop]: trace histogram [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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 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-16 15:23:53,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 15:23:53,510 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:53,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:53,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1201886420, now seen corresponding path program 1 times [2025-03-16 15:23:53,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:53,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799951198] [2025-03-16 15:23:53,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:53,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:53,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1991 statements into 1 equivalence classes. [2025-03-16 15:23:53,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1991 of 1991 statements. [2025-03-16 15:23:53,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:53,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:56,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3412 backedges. 2470 proven. 0 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2025-03-16 15:23:56,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:56,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799951198] [2025-03-16 15:23:56,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799951198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:56,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:56,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 15:23:56,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649211738] [2025-03-16 15:23:56,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:56,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 15:23:56,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:56,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 15:23:56,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:23:56,913 INFO L87 Difference]: Start difference. First operand 83493 states and 85524 transitions. Second operand has 9 states, 9 states have (on average 163.88888888888889) internal successors, (1475), 9 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)