./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label43.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label43.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 35560e922bf8333807d0348ddb335d0f345175bbe017d76c2c9d638827ad9537 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:44:29,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:44:29,315 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:44:29,321 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:44:29,321 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:44:29,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:44:29,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:44:29,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:44:29,339 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:44:29,339 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:44:29,340 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:44:29,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:44:29,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:44:29,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:44:29,340 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:44:29,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:44:29,341 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:44:29,341 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:44:29,341 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:44:29,341 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:44:29,341 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:44:29,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:44:29,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:44:29,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:44:29,341 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:44:29,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:44:29,341 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:44:29,341 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:44:29,341 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:44:29,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:44:29,342 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:44:29,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:44:29,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:44:29,342 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:44:29,342 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:44:29,342 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:44:29,343 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:44:29,343 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:44:29,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:44:29,343 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:44:29,343 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:44:29,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:44:29,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:44:29,343 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 -> 35560e922bf8333807d0348ddb335d0f345175bbe017d76c2c9d638827ad9537 [2025-03-03 10:44:29,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:44:29,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:44:29,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:44:29,590 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:44:29,590 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:44:29,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label43.c [2025-03-03 10:44:30,695 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be1babbb6/57ee837d977d4f09806be51ab3f310b0/FLAG3d544778c [2025-03-03 10:44:31,117 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:44:31,118 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label43.c [2025-03-03 10:44:31,148 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be1babbb6/57ee837d977d4f09806be51ab3f310b0/FLAG3d544778c [2025-03-03 10:44:31,276 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be1babbb6/57ee837d977d4f09806be51ab3f310b0 [2025-03-03 10:44:31,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:44:31,279 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:44:31,281 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:44:31,282 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:44:31,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:44:31,286 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:44:31" (1/1) ... [2025-03-03 10:44:31,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@130f49a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:31, skipping insertion in model container [2025-03-03 10:44:31,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:44:31" (1/1) ... [2025-03-03 10:44:31,381 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:44:31,580 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/Problem13_label43.c[2870,2883] [2025-03-03 10:44:32,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:44:32,079 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:44:32,094 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/Problem13_label43.c[2870,2883] [2025-03-03 10:44:32,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:44:32,419 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:44:32,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:32 WrapperNode [2025-03-03 10:44:32,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:44:32,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:44:32,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:44:32,423 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:44:32,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:32" (1/1) ... [2025-03-03 10:44:32,474 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:32" (1/1) ... [2025-03-03 10:44:32,791 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-03 10:44:32,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:44:32,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:44:32,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:44:32,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:44:32,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:32" (1/1) ... [2025-03-03 10:44:32,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:32" (1/1) ... [2025-03-03 10:44:32,875 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:32" (1/1) ... [2025-03-03 10:44:33,124 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:44:33,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:32" (1/1) ... [2025-03-03 10:44:33,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:32" (1/1) ... [2025-03-03 10:44:33,243 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:32" (1/1) ... [2025-03-03 10:44:33,268 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:32" (1/1) ... [2025-03-03 10:44:33,293 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:32" (1/1) ... [2025-03-03 10:44:33,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:32" (1/1) ... [2025-03-03 10:44:33,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:44:33,363 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:44:33,363 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:44:33,363 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:44:33,364 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:32" (1/1) ... [2025-03-03 10:44:33,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:44:33,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:44:33,388 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:44:33,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:44:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:44:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:44:33,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:44:33,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:44:33,457 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:44:33,458 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:44:37,749 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-03 10:44:37,750 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:44:37,750 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:44:37,885 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-03 10:44:37,885 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:44:37,915 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:44:37,916 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:44:37,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:44:37 BoogieIcfgContainer [2025-03-03 10:44:37,916 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:44:37,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:44:37,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:44:37,924 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:44:37,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:44:31" (1/3) ... [2025-03-03 10:44:37,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41780f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:44:37, skipping insertion in model container [2025-03-03 10:44:37,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:32" (2/3) ... [2025-03-03 10:44:37,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41780f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:44:37, skipping insertion in model container [2025-03-03 10:44:37,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:44:37" (3/3) ... [2025-03-03 10:44:37,927 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label43.c [2025-03-03 10:44:37,938 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:44:37,939 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label43.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:44:38,009 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:44:38,019 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;@28515ed2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:44:38,020 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:44:38,028 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:38,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 10:44:38,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:38,033 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:44:38,033 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:38,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:38,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1430154572, now seen corresponding path program 1 times [2025-03-03 10:44:38,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:38,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113348491] [2025-03-03 10:44:38,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:38,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:38,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 10:44:38,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 10:44:38,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:38,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:38,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:44:38,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:38,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113348491] [2025-03-03 10:44:38,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113348491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:38,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:38,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:44:38,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262441869] [2025-03-03 10:44:38,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:38,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:38,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:38,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:38,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:38,254 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:41,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:41,849 INFO L93 Difference]: Finished difference Result 3160 states and 5840 transitions. [2025-03-03 10:44:41,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:41,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2025-03-03 10:44:41,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:41,874 INFO L225 Difference]: With dead ends: 3160 [2025-03-03 10:44:41,875 INFO L226 Difference]: Without dead ends: 1983 [2025-03-03 10:44:41,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:41,886 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 1085 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3030 mSolverCounterSat, 974 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 4004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 974 IncrementalHoareTripleChecker+Valid, 3030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:41,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 349 Invalid, 4004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [974 Valid, 3030 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-03 10:44:41,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2025-03-03 10:44:41,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1930. [2025-03-03 10:44:41,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1929 states have (on average 1.7973043027475375) internal successors, (3467), 1929 states have internal predecessors, (3467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:41,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 3467 transitions. [2025-03-03 10:44:41,998 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 3467 transitions. Word has length 18 [2025-03-03 10:44:41,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:41,999 INFO L471 AbstractCegarLoop]: Abstraction has 1930 states and 3467 transitions. [2025-03-03 10:44:41,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:41,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 3467 transitions. [2025-03-03 10:44:42,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 10:44:42,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:42,001 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] [2025-03-03 10:44:42,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:44:42,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:42,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:42,002 INFO L85 PathProgramCache]: Analyzing trace with hash -455759835, now seen corresponding path program 1 times [2025-03-03 10:44:42,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:42,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038221605] [2025-03-03 10:44:42,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:42,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:42,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 10:44:42,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 10:44:42,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:42,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:42,407 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-03 10:44:42,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:42,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038221605] [2025-03-03 10:44:42,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038221605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:42,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:42,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:44:42,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634023825] [2025-03-03 10:44:42,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:42,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:42,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:42,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:42,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:42,410 INFO L87 Difference]: Start difference. First operand 1930 states and 3467 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:45,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:45,361 INFO L93 Difference]: Finished difference Result 4718 states and 8523 transitions. [2025-03-03 10:44:45,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:45,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-03-03 10:44:45,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:45,373 INFO L225 Difference]: With dead ends: 4718 [2025-03-03 10:44:45,374 INFO L226 Difference]: Without dead ends: 2790 [2025-03-03 10:44:45,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:45,379 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 815 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 3015 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 3316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 3015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:45,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 737 Invalid, 3316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 3015 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-03 10:44:45,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2025-03-03 10:44:45,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 2729. [2025-03-03 10:44:45,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2729 states, 2728 states have (on average 1.7001466275659824) internal successors, (4638), 2728 states have internal predecessors, (4638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:45,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2729 states and 4638 transitions. [2025-03-03 10:44:45,436 INFO L78 Accepts]: Start accepts. Automaton has 2729 states and 4638 transitions. Word has length 83 [2025-03-03 10:44:45,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:45,437 INFO L471 AbstractCegarLoop]: Abstraction has 2729 states and 4638 transitions. [2025-03-03 10:44:45,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:45,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2729 states and 4638 transitions. [2025-03-03 10:44:45,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 10:44:45,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:45,439 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] [2025-03-03 10:44:45,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:44:45,439 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:45,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:45,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1571474796, now seen corresponding path program 1 times [2025-03-03 10:44:45,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:45,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480108393] [2025-03-03 10:44:45,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:45,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:45,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 10:44:45,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 10:44:45,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:45,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:45,582 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-03 10:44:45,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:45,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480108393] [2025-03-03 10:44:45,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480108393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:45,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:45,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:44:45,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600257353] [2025-03-03 10:44:45,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:45,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:45,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:45,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:45,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:45,583 INFO L87 Difference]: Start difference. First operand 2729 states and 4638 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:48,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:48,491 INFO L93 Difference]: Finished difference Result 7864 states and 13451 transitions. [2025-03-03 10:44:48,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:48,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-03 10:44:48,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:48,509 INFO L225 Difference]: With dead ends: 7864 [2025-03-03 10:44:48,509 INFO L226 Difference]: Without dead ends: 5137 [2025-03-03 10:44:48,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:48,514 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 937 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2604 mSolverCounterSat, 748 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 3352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 748 IncrementalHoareTripleChecker+Valid, 2604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:48,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 1016 Invalid, 3352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [748 Valid, 2604 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 10:44:48,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5137 states. [2025-03-03 10:44:48,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5137 to 5127. [2025-03-03 10:44:48,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5127 states, 5126 states have (on average 1.533164260632072) internal successors, (7859), 5126 states have internal predecessors, (7859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:48,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5127 states to 5127 states and 7859 transitions. [2025-03-03 10:44:48,584 INFO L78 Accepts]: Start accepts. Automaton has 5127 states and 7859 transitions. Word has length 89 [2025-03-03 10:44:48,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:48,585 INFO L471 AbstractCegarLoop]: Abstraction has 5127 states and 7859 transitions. [2025-03-03 10:44:48,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:48,585 INFO L276 IsEmpty]: Start isEmpty. Operand 5127 states and 7859 transitions. [2025-03-03 10:44:48,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 10:44:48,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:48,586 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] [2025-03-03 10:44:48,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:44:48,587 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:48,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:48,587 INFO L85 PathProgramCache]: Analyzing trace with hash -689569974, now seen corresponding path program 1 times [2025-03-03 10:44:48,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:48,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454205231] [2025-03-03 10:44:48,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:48,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:48,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 10:44:48,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 10:44:48,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:48,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:48,877 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-03 10:44:48,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:48,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454205231] [2025-03-03 10:44:48,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454205231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:48,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:48,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:44:48,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070591971] [2025-03-03 10:44:48,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:48,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:48,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:48,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:48,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:48,878 INFO L87 Difference]: Start difference. First operand 5127 states and 7859 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:51,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:51,285 INFO L93 Difference]: Finished difference Result 11046 states and 16686 transitions. [2025-03-03 10:44:51,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:51,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2025-03-03 10:44:51,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:51,303 INFO L225 Difference]: With dead ends: 11046 [2025-03-03 10:44:51,303 INFO L226 Difference]: Without dead ends: 5921 [2025-03-03 10:44:51,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:51,310 INFO L435 NwaCegarLoop]: 1048 mSDtfsCounter, 685 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2569 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 2704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 2569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:51,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1177 Invalid, 2704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 2569 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:44:51,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5921 states. [2025-03-03 10:44:51,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5921 to 5915. [2025-03-03 10:44:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5915 states, 5914 states have (on average 1.4680419343929658) internal successors, (8682), 5914 states have internal predecessors, (8682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:51,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5915 states to 5915 states and 8682 transitions. [2025-03-03 10:44:51,390 INFO L78 Accepts]: Start accepts. Automaton has 5915 states and 8682 transitions. Word has length 129 [2025-03-03 10:44:51,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:51,391 INFO L471 AbstractCegarLoop]: Abstraction has 5915 states and 8682 transitions. [2025-03-03 10:44:51,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:51,392 INFO L276 IsEmpty]: Start isEmpty. Operand 5915 states and 8682 transitions. [2025-03-03 10:44:51,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 10:44:51,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:51,393 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] [2025-03-03 10:44:51,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:44:51,393 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:51,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:51,393 INFO L85 PathProgramCache]: Analyzing trace with hash 151539488, now seen corresponding path program 1 times [2025-03-03 10:44:51,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:51,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079713082] [2025-03-03 10:44:51,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:51,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:51,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 10:44:51,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 10:44:51,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:51,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:51,520 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-03 10:44:51,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:51,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079713082] [2025-03-03 10:44:51,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079713082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:51,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:51,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:44:51,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382202036] [2025-03-03 10:44:51,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:51,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:51,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:51,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:51,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:51,521 INFO L87 Difference]: Start difference. First operand 5915 states and 8682 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:54,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:54,202 INFO L93 Difference]: Finished difference Result 15807 states and 23906 transitions. [2025-03-03 10:44:54,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:54,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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 143 [2025-03-03 10:44:54,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:54,228 INFO L225 Difference]: With dead ends: 15807 [2025-03-03 10:44:54,228 INFO L226 Difference]: Without dead ends: 10682 [2025-03-03 10:44:54,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:54,236 INFO L435 NwaCegarLoop]: 986 mSDtfsCounter, 755 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2473 mSolverCounterSat, 793 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 3266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 793 IncrementalHoareTripleChecker+Valid, 2473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:54,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 1136 Invalid, 3266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [793 Valid, 2473 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 10:44:54,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10682 states. [2025-03-03 10:44:54,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10682 to 10659. [2025-03-03 10:44:54,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10659 states, 10658 states have (on average 1.3172264965284293) internal successors, (14039), 10658 states have internal predecessors, (14039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:54,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10659 states to 10659 states and 14039 transitions. [2025-03-03 10:44:54,437 INFO L78 Accepts]: Start accepts. Automaton has 10659 states and 14039 transitions. Word has length 143 [2025-03-03 10:44:54,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:54,437 INFO L471 AbstractCegarLoop]: Abstraction has 10659 states and 14039 transitions. [2025-03-03 10:44:54,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:54,437 INFO L276 IsEmpty]: Start isEmpty. Operand 10659 states and 14039 transitions. [2025-03-03 10:44:54,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 10:44:54,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:54,440 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] [2025-03-03 10:44:54,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:44:54,440 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:54,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:54,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1902968494, now seen corresponding path program 1 times [2025-03-03 10:44:54,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:54,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316621199] [2025-03-03 10:44:54,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:54,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:54,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 10:44:54,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 10:44:54,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:54,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:54,593 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-03 10:44:54,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:54,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316621199] [2025-03-03 10:44:54,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316621199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:54,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:54,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:44:54,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397905592] [2025-03-03 10:44:54,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:54,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:54,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:54,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:54,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:54,595 INFO L87 Difference]: Start difference. First operand 10659 states and 14039 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:57,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:57,170 INFO L93 Difference]: Finished difference Result 23671 states and 32238 transitions. [2025-03-03 10:44:57,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:57,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 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 179 [2025-03-03 10:44:57,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:57,192 INFO L225 Difference]: With dead ends: 23671 [2025-03-03 10:44:57,192 INFO L226 Difference]: Without dead ends: 13801 [2025-03-03 10:44:57,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:57,202 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 880 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2321 mSolverCounterSat, 874 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 3195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 874 IncrementalHoareTripleChecker+Valid, 2321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:57,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 1019 Invalid, 3195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [874 Valid, 2321 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:44:57,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13801 states. [2025-03-03 10:44:57,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13801 to 13798. [2025-03-03 10:44:57,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13798 states, 13797 states have (on average 1.247155178662028) internal successors, (17207), 13797 states have internal predecessors, (17207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:57,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13798 states to 13798 states and 17207 transitions. [2025-03-03 10:44:57,355 INFO L78 Accepts]: Start accepts. Automaton has 13798 states and 17207 transitions. Word has length 179 [2025-03-03 10:44:57,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:57,356 INFO L471 AbstractCegarLoop]: Abstraction has 13798 states and 17207 transitions. [2025-03-03 10:44:57,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:57,357 INFO L276 IsEmpty]: Start isEmpty. Operand 13798 states and 17207 transitions. [2025-03-03 10:44:57,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-03 10:44:57,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:57,359 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:44:57,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:44:57,359 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:57,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:57,359 INFO L85 PathProgramCache]: Analyzing trace with hash -147847507, now seen corresponding path program 1 times [2025-03-03 10:44:57,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:57,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689707281] [2025-03-03 10:44:57,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:57,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:57,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-03 10:44:57,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-03 10:44:57,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:57,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:57,641 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:44:57,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:57,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689707281] [2025-03-03 10:44:57,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689707281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:57,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:57,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:57,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637376476] [2025-03-03 10:44:57,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:57,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:57,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:57,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:57,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:57,644 INFO L87 Difference]: Start difference. First operand 13798 states and 17207 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:00,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:00,398 INFO L93 Difference]: Finished difference Result 33140 states and 42604 transitions. [2025-03-03 10:45:00,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:00,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 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 230 [2025-03-03 10:45:00,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:00,433 INFO L225 Difference]: With dead ends: 33140 [2025-03-03 10:45:00,433 INFO L226 Difference]: Without dead ends: 20131 [2025-03-03 10:45:00,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:00,446 INFO L435 NwaCegarLoop]: 1800 mSDtfsCounter, 773 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2560 mSolverCounterSat, 715 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1942 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 715 IncrementalHoareTripleChecker+Valid, 2560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:00,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 1942 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [715 Valid, 2560 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 10:45:00,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20131 states. [2025-03-03 10:45:00,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20131 to 20100. [2025-03-03 10:45:00,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20100 states, 20099 states have (on average 1.206925717697398) internal successors, (24258), 20099 states have internal predecessors, (24258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:00,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20100 states to 20100 states and 24258 transitions. [2025-03-03 10:45:00,695 INFO L78 Accepts]: Start accepts. Automaton has 20100 states and 24258 transitions. Word has length 230 [2025-03-03 10:45:00,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:00,695 INFO L471 AbstractCegarLoop]: Abstraction has 20100 states and 24258 transitions. [2025-03-03 10:45:00,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:00,696 INFO L276 IsEmpty]: Start isEmpty. Operand 20100 states and 24258 transitions. [2025-03-03 10:45:00,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-03 10:45:00,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:00,697 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:00,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:45:00,697 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:00,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:00,698 INFO L85 PathProgramCache]: Analyzing trace with hash 437833775, now seen corresponding path program 1 times [2025-03-03 10:45:00,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:00,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811547308] [2025-03-03 10:45:00,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:00,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:00,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-03 10:45:00,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-03 10:45:00,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:00,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:00,833 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:45:00,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:00,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811547308] [2025-03-03 10:45:00,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811547308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:00,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:00,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:00,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370910005] [2025-03-03 10:45:00,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:00,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:00,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:00,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:00,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:00,836 INFO L87 Difference]: Start difference. First operand 20100 states and 24258 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:03,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:03,758 INFO L93 Difference]: Finished difference Result 57506 states and 69736 transitions. [2025-03-03 10:45:03,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:03,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2025-03-03 10:45:03,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:03,803 INFO L225 Difference]: With dead ends: 57506 [2025-03-03 10:45:03,803 INFO L226 Difference]: Without dead ends: 37405 [2025-03-03 10:45:03,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:03,825 INFO L435 NwaCegarLoop]: 1696 mSDtfsCounter, 937 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2420 mSolverCounterSat, 812 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 1832 SdHoareTripleChecker+Invalid, 3232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 812 IncrementalHoareTripleChecker+Valid, 2420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:03,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 1832 Invalid, 3232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [812 Valid, 2420 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 10:45:03,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37405 states. [2025-03-03 10:45:04,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37405 to 36613. [2025-03-03 10:45:04,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36613 states, 36612 states have (on average 1.1606303944062055) internal successors, (42493), 36612 states have internal predecessors, (42493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:04,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36613 states to 36613 states and 42493 transitions. [2025-03-03 10:45:04,304 INFO L78 Accepts]: Start accepts. Automaton has 36613 states and 42493 transitions. Word has length 232 [2025-03-03 10:45:04,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:04,305 INFO L471 AbstractCegarLoop]: Abstraction has 36613 states and 42493 transitions. [2025-03-03 10:45:04,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:04,305 INFO L276 IsEmpty]: Start isEmpty. Operand 36613 states and 42493 transitions. [2025-03-03 10:45:04,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-03 10:45:04,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:04,310 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:04,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:45:04,311 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:04,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:04,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1196203214, now seen corresponding path program 1 times [2025-03-03 10:45:04,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:04,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506593670] [2025-03-03 10:45:04,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:04,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:04,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-03 10:45:04,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-03 10:45:04,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:04,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:04,921 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 34 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:45:04,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:04,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506593670] [2025-03-03 10:45:04,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506593670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:45:04,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559032681] [2025-03-03 10:45:04,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:04,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:45:04,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:45:04,926 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:45:04,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:45:04,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-03 10:45:05,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-03 10:45:05,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:05,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:05,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:45:05,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:45:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-03 10:45:05,084 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:45:05,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559032681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:05,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:45:05,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:45:05,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645564961] [2025-03-03 10:45:05,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:05,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:05,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:05,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:05,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:45:05,085 INFO L87 Difference]: Start difference. First operand 36613 states and 42493 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:07,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:07,514 INFO L93 Difference]: Finished difference Result 72435 states and 84191 transitions. [2025-03-03 10:45:07,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:07,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 259 [2025-03-03 10:45:07,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:07,564 INFO L225 Difference]: With dead ends: 72435 [2025-03-03 10:45:07,564 INFO L226 Difference]: Without dead ends: 36611 [2025-03-03 10:45:07,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:45:07,585 INFO L435 NwaCegarLoop]: 1356 mSDtfsCounter, 1188 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2461 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 2906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 2461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:07,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 1437 Invalid, 2906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 2461 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:45:07,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36611 states. [2025-03-03 10:45:07,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36611 to 36610. [2025-03-03 10:45:07,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36610 states, 36609 states have (on average 1.128793466087574) internal successors, (41324), 36609 states have internal predecessors, (41324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:07,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36610 states to 36610 states and 41324 transitions. [2025-03-03 10:45:07,911 INFO L78 Accepts]: Start accepts. Automaton has 36610 states and 41324 transitions. Word has length 259 [2025-03-03 10:45:07,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:07,911 INFO L471 AbstractCegarLoop]: Abstraction has 36610 states and 41324 transitions. [2025-03-03 10:45:07,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:07,911 INFO L276 IsEmpty]: Start isEmpty. Operand 36610 states and 41324 transitions. [2025-03-03 10:45:07,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-03 10:45:07,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:07,915 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:07,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 10:45:08,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:45:08,120 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:08,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:08,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1252554979, now seen corresponding path program 1 times [2025-03-03 10:45:08,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:08,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662884135] [2025-03-03 10:45:08,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:08,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:08,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-03 10:45:08,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-03 10:45:08,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:08,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:09,027 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 160 proven. 113 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 10:45:09,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:09,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662884135] [2025-03-03 10:45:09,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662884135] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:45:09,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498561102] [2025-03-03 10:45:09,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:09,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:45:09,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:45:09,030 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:45:09,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:45:09,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-03 10:45:09,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-03 10:45:09,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:09,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:09,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:45:09,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:45:09,222 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-03 10:45:09,222 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:45:09,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498561102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:09,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:45:09,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-03 10:45:09,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516351198] [2025-03-03 10:45:09,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:09,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:09,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:09,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:09,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:45:09,223 INFO L87 Difference]: Start difference. First operand 36610 states and 41324 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:12,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:12,057 INFO L93 Difference]: Finished difference Result 72420 states and 81844 transitions. [2025-03-03 10:45:12,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:12,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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 324 [2025-03-03 10:45:12,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:12,097 INFO L225 Difference]: With dead ends: 72420 [2025-03-03 10:45:12,097 INFO L226 Difference]: Without dead ends: 36599 [2025-03-03 10:45:12,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:45:12,118 INFO L435 NwaCegarLoop]: 678 mSDtfsCounter, 1071 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 2387 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 2387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:12,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 809 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 2387 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:45:12,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36599 states. [2025-03-03 10:45:12,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36599 to 36596. [2025-03-03 10:45:12,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36596 states, 36595 states have (on average 1.0920890832080885) internal successors, (39965), 36595 states have internal predecessors, (39965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:12,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36596 states to 36596 states and 39965 transitions. [2025-03-03 10:45:12,480 INFO L78 Accepts]: Start accepts. Automaton has 36596 states and 39965 transitions. Word has length 324 [2025-03-03 10:45:12,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:12,481 INFO L471 AbstractCegarLoop]: Abstraction has 36596 states and 39965 transitions. [2025-03-03 10:45:12,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:12,481 INFO L276 IsEmpty]: Start isEmpty. Operand 36596 states and 39965 transitions. [2025-03-03 10:45:12,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-03-03 10:45:12,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:12,484 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, 4, 4, 3, 3, 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] [2025-03-03 10:45:12,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 10:45:12,684 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,SelfDestructingSolverStorable9 [2025-03-03 10:45:12,684 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:12,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:12,685 INFO L85 PathProgramCache]: Analyzing trace with hash 945753013, now seen corresponding path program 1 times [2025-03-03 10:45:12,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:12,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767381847] [2025-03-03 10:45:12,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:12,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:12,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-03 10:45:12,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-03 10:45:12,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:12,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:12,863 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-03-03 10:45:12,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:12,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767381847] [2025-03-03 10:45:12,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767381847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:12,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:12,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:12,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121494406] [2025-03-03 10:45:12,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:12,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:12,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:12,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:12,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:12,864 INFO L87 Difference]: Start difference. First operand 36596 states and 39965 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:15,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:15,966 INFO L93 Difference]: Finished difference Result 89055 states and 97472 transitions. [2025-03-03 10:45:15,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:15,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 347 [2025-03-03 10:45:15,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:16,015 INFO L225 Difference]: With dead ends: 89055 [2025-03-03 10:45:16,015 INFO L226 Difference]: Without dead ends: 52460 [2025-03-03 10:45:16,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:16,031 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 1002 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 3012 mSolverCounterSat, 698 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 3710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 698 IncrementalHoareTripleChecker+Valid, 3012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:16,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1002 Valid, 741 Invalid, 3710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [698 Valid, 3012 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 10:45:16,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52460 states. [2025-03-03 10:45:16,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52460 to 36595. [2025-03-03 10:45:16,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36595 states, 36594 states have (on average 1.0920915997158005) internal successors, (39964), 36594 states have internal predecessors, (39964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:16,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36595 states to 36595 states and 39964 transitions. [2025-03-03 10:45:16,335 INFO L78 Accepts]: Start accepts. Automaton has 36595 states and 39964 transitions. Word has length 347 [2025-03-03 10:45:16,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:16,335 INFO L471 AbstractCegarLoop]: Abstraction has 36595 states and 39964 transitions. [2025-03-03 10:45:16,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:16,336 INFO L276 IsEmpty]: Start isEmpty. Operand 36595 states and 39964 transitions. [2025-03-03 10:45:16,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-03-03 10:45:16,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:16,340 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, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:16,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:45:16,340 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:16,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:16,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1231239609, now seen corresponding path program 1 times [2025-03-03 10:45:16,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:16,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62794369] [2025-03-03 10:45:16,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:16,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:16,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-03 10:45:16,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-03 10:45:16,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:16,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:16,480 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 392 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-03 10:45:16,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:16,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62794369] [2025-03-03 10:45:16,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62794369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:16,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:16,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:16,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573196364] [2025-03-03 10:45:16,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:16,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:16,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:16,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:16,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:16,483 INFO L87 Difference]: Start difference. First operand 36595 states and 39964 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:19,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:19,674 INFO L93 Difference]: Finished difference Result 85006 states and 93886 transitions. [2025-03-03 10:45:19,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:19,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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 374 [2025-03-03 10:45:19,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:19,739 INFO L225 Difference]: With dead ends: 85006 [2025-03-03 10:45:19,740 INFO L226 Difference]: Without dead ends: 49200 [2025-03-03 10:45:19,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:19,753 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 905 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2397 mSolverCounterSat, 970 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 3367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 970 IncrementalHoareTripleChecker+Valid, 2397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:19,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 808 Invalid, 3367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [970 Valid, 2397 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-03 10:45:19,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49200 states. [2025-03-03 10:45:20,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49200 to 47611. [2025-03-03 10:45:20,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47611 states, 47610 states have (on average 1.1004200798151649) internal successors, (52391), 47610 states have internal predecessors, (52391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:20,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47611 states to 47611 states and 52391 transitions. [2025-03-03 10:45:20,108 INFO L78 Accepts]: Start accepts. Automaton has 47611 states and 52391 transitions. Word has length 374 [2025-03-03 10:45:20,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:20,109 INFO L471 AbstractCegarLoop]: Abstraction has 47611 states and 52391 transitions. [2025-03-03 10:45:20,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:20,109 INFO L276 IsEmpty]: Start isEmpty. Operand 47611 states and 52391 transitions. [2025-03-03 10:45:20,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-03-03 10:45:20,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:20,116 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:20,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:45:20,117 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:20,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:20,117 INFO L85 PathProgramCache]: Analyzing trace with hash -29524397, now seen corresponding path program 1 times [2025-03-03 10:45:20,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:20,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601259118] [2025-03-03 10:45:20,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:20,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:20,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-03 10:45:20,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-03 10:45:20,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:20,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2025-03-03 10:45:20,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:20,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601259118] [2025-03-03 10:45:20,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601259118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:20,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:20,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:20,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993856803] [2025-03-03 10:45:20,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:20,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:20,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:20,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:20,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:20,300 INFO L87 Difference]: Start difference. First operand 47611 states and 52391 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:23,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:23,092 INFO L93 Difference]: Finished difference Result 115778 states and 126846 transitions. [2025-03-03 10:45:23,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:23,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 407 [2025-03-03 10:45:23,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:23,163 INFO L225 Difference]: With dead ends: 115778 [2025-03-03 10:45:23,163 INFO L226 Difference]: Without dead ends: 66588 [2025-03-03 10:45:23,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:23,193 INFO L435 NwaCegarLoop]: 1893 mSDtfsCounter, 939 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 2687 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 2067 SdHoareTripleChecker+Invalid, 2920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 2687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:23,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 2067 Invalid, 2920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 2687 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:45:23,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66588 states. [2025-03-03 10:45:23,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66588 to 61059. [2025-03-03 10:45:23,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61059 states, 61058 states have (on average 1.0913230043565134) internal successors, (66634), 61058 states have internal predecessors, (66634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:23,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61059 states to 61059 states and 66634 transitions. [2025-03-03 10:45:23,680 INFO L78 Accepts]: Start accepts. Automaton has 61059 states and 66634 transitions. Word has length 407 [2025-03-03 10:45:23,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:23,681 INFO L471 AbstractCegarLoop]: Abstraction has 61059 states and 66634 transitions. [2025-03-03 10:45:23,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:23,681 INFO L276 IsEmpty]: Start isEmpty. Operand 61059 states and 66634 transitions. [2025-03-03 10:45:23,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2025-03-03 10:45:23,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:23,686 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, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:23,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:45:23,686 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:23,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:23,687 INFO L85 PathProgramCache]: Analyzing trace with hash -150827377, now seen corresponding path program 1 times [2025-03-03 10:45:23,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:23,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351995642] [2025-03-03 10:45:23,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:23,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:23,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-03-03 10:45:23,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-03-03 10:45:23,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:23,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:23,825 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 392 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-03 10:45:23,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:23,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351995642] [2025-03-03 10:45:23,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351995642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:23,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:23,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:23,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504762416] [2025-03-03 10:45:23,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:23,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:23,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:23,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:23,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:23,828 INFO L87 Difference]: Start difference. First operand 61059 states and 66634 transitions. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:26,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:26,390 INFO L93 Difference]: Finished difference Result 123695 states and 134857 transitions. [2025-03-03 10:45:26,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:26,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 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 417 [2025-03-03 10:45:26,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:26,465 INFO L225 Difference]: With dead ends: 123695 [2025-03-03 10:45:26,466 INFO L226 Difference]: Without dead ends: 63425 [2025-03-03 10:45:26,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:26,502 INFO L435 NwaCegarLoop]: 1417 mSDtfsCounter, 895 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2487 mSolverCounterSat, 585 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 3072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 585 IncrementalHoareTripleChecker+Valid, 2487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:26,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 1502 Invalid, 3072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [585 Valid, 2487 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:45:26,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63425 states. [2025-03-03 10:45:26,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63425 to 60263. [2025-03-03 10:45:26,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60263 states, 60262 states have (on average 1.0646676180677708) internal successors, (64159), 60262 states have internal predecessors, (64159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:27,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60263 states to 60263 states and 64159 transitions. [2025-03-03 10:45:27,007 INFO L78 Accepts]: Start accepts. Automaton has 60263 states and 64159 transitions. Word has length 417 [2025-03-03 10:45:27,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:27,007 INFO L471 AbstractCegarLoop]: Abstraction has 60263 states and 64159 transitions. [2025-03-03 10:45:27,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:27,007 INFO L276 IsEmpty]: Start isEmpty. Operand 60263 states and 64159 transitions. [2025-03-03 10:45:27,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2025-03-03 10:45:27,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:27,019 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:27,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:45:27,019 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:27,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:27,020 INFO L85 PathProgramCache]: Analyzing trace with hash -378745451, now seen corresponding path program 1 times [2025-03-03 10:45:27,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:27,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547578497] [2025-03-03 10:45:27,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:27,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:27,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-03-03 10:45:27,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-03-03 10:45:27,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:27,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:27,203 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 682 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:45:27,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:27,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547578497] [2025-03-03 10:45:27,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547578497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:27,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:27,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:27,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417894197] [2025-03-03 10:45:27,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:27,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:45:27,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:27,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:45:27,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:45:27,205 INFO L87 Difference]: Start difference. First operand 60263 states and 64159 transitions. Second operand has 4 states, 4 states have (on average 85.75) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:32,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:32,127 INFO L93 Difference]: Finished difference Result 199530 states and 212978 transitions. [2025-03-03 10:45:32,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:45:32,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.75) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 539 [2025-03-03 10:45:32,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:32,278 INFO L225 Difference]: With dead ends: 199530 [2025-03-03 10:45:32,278 INFO L226 Difference]: Without dead ends: 139268 [2025-03-03 10:45:32,338 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-03 10:45:32,338 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 1705 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 5947 mSolverCounterSat, 1065 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1705 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 7012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1065 IncrementalHoareTripleChecker+Valid, 5947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:32,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1705 Valid, 762 Invalid, 7012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1065 Valid, 5947 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-03 10:45:32,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139268 states. [2025-03-03 10:45:33,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139268 to 105981. [2025-03-03 10:45:33,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105981 states, 105980 states have (on average 1.0611719192300435) internal successors, (112463), 105980 states have internal predecessors, (112463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:33,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105981 states to 105981 states and 112463 transitions. [2025-03-03 10:45:33,424 INFO L78 Accepts]: Start accepts. Automaton has 105981 states and 112463 transitions. Word has length 539 [2025-03-03 10:45:33,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:33,424 INFO L471 AbstractCegarLoop]: Abstraction has 105981 states and 112463 transitions. [2025-03-03 10:45:33,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.75) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:33,424 INFO L276 IsEmpty]: Start isEmpty. Operand 105981 states and 112463 transitions. [2025-03-03 10:45:33,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2025-03-03 10:45:33,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:33,437 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:33,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:45:33,437 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:33,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:33,437 INFO L85 PathProgramCache]: Analyzing trace with hash -448124836, now seen corresponding path program 1 times [2025-03-03 10:45:33,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:33,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065766935] [2025-03-03 10:45:33,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:33,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:33,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 552 statements into 1 equivalence classes. [2025-03-03 10:45:33,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 552 of 552 statements. [2025-03-03 10:45:33,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:33,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:33,651 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 683 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-03 10:45:33,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:33,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065766935] [2025-03-03 10:45:33,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065766935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:33,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:33,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:33,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132888743] [2025-03-03 10:45:33,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:33,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:33,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:33,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:33,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:33,653 INFO L87 Difference]: Start difference. First operand 105981 states and 112463 transitions. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:36,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:36,567 INFO L93 Difference]: Finished difference Result 242677 states and 258458 transitions. [2025-03-03 10:45:36,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:36,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 552 [2025-03-03 10:45:36,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:36,707 INFO L225 Difference]: With dead ends: 242677 [2025-03-03 10:45:36,707 INFO L226 Difference]: Without dead ends: 132763 [2025-03-03 10:45:36,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:36,764 INFO L435 NwaCegarLoop]: 1738 mSDtfsCounter, 782 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 459 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 1881 SdHoareTripleChecker+Invalid, 2980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 459 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:36,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 1881 Invalid, 2980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [459 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:45:36,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132763 states. [2025-03-03 10:45:38,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132763 to 132739. [2025-03-03 10:45:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132739 states, 132738 states have (on average 1.0547620123853003) internal successors, (140007), 132738 states have internal predecessors, (140007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:38,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132739 states to 132739 states and 140007 transitions. [2025-03-03 10:45:38,436 INFO L78 Accepts]: Start accepts. Automaton has 132739 states and 140007 transitions. Word has length 552 [2025-03-03 10:45:38,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:38,436 INFO L471 AbstractCegarLoop]: Abstraction has 132739 states and 140007 transitions. [2025-03-03 10:45:38,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:38,436 INFO L276 IsEmpty]: Start isEmpty. Operand 132739 states and 140007 transitions. [2025-03-03 10:45:38,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2025-03-03 10:45:38,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:38,450 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, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:38,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:45:38,451 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:38,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:38,451 INFO L85 PathProgramCache]: Analyzing trace with hash -299790036, now seen corresponding path program 1 times [2025-03-03 10:45:38,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:38,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882698308] [2025-03-03 10:45:38,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:38,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:38,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 561 statements into 1 equivalence classes. [2025-03-03 10:45:38,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 561 of 561 statements. [2025-03-03 10:45:38,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:38,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:38,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1222 backedges. 880 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2025-03-03 10:45:38,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:38,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882698308] [2025-03-03 10:45:38,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882698308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:38,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:38,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:38,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50295535] [2025-03-03 10:45:38,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:38,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:38,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:38,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:38,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:38,749 INFO L87 Difference]: Start difference. First operand 132739 states and 140007 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:42,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:42,489 INFO L93 Difference]: Finished difference Result 308002 states and 325999 transitions. [2025-03-03 10:45:42,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:42,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 561 [2025-03-03 10:45:42,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:42,686 INFO L225 Difference]: With dead ends: 308002 [2025-03-03 10:45:42,687 INFO L226 Difference]: Without dead ends: 176052 [2025-03-03 10:45:42,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:42,748 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 1015 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2457 mSolverCounterSat, 976 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 3433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 976 IncrementalHoareTripleChecker+Valid, 2457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:42,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 636 Invalid, 3433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [976 Valid, 2457 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-03 10:45:42,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176052 states. [2025-03-03 10:45:44,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176052 to 175261. [2025-03-03 10:45:44,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175261 states, 175260 states have (on average 1.0561394499600594) internal successors, (185099), 175260 states have internal predecessors, (185099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175261 states to 175261 states and 185099 transitions. [2025-03-03 10:45:44,714 INFO L78 Accepts]: Start accepts. Automaton has 175261 states and 185099 transitions. Word has length 561 [2025-03-03 10:45:44,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:44,715 INFO L471 AbstractCegarLoop]: Abstraction has 175261 states and 185099 transitions. [2025-03-03 10:45:44,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:44,715 INFO L276 IsEmpty]: Start isEmpty. Operand 175261 states and 185099 transitions. [2025-03-03 10:45:44,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2025-03-03 10:45:44,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:44,743 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, 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] [2025-03-03 10:45:44,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:45:44,743 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:44,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:44,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1696076143, now seen corresponding path program 1 times [2025-03-03 10:45:44,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:44,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422590922] [2025-03-03 10:45:44,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:44,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:44,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-03-03 10:45:44,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-03-03 10:45:44,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:44,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:46,465 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 269 proven. 113 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 10:45:46,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:46,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422590922] [2025-03-03 10:45:46,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422590922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:45:46,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232465969] [2025-03-03 10:45:46,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:46,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:45:46,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:45:46,476 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:45:46,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:45:46,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-03-03 10:45:46,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-03-03 10:45:46,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:46,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:46,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:45:46,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:45:47,178 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-03 10:45:47,178 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:45:47,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232465969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:47,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:45:47,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-03 10:45:47,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527855875] [2025-03-03 10:45:47,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:47,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:47,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:47,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:47,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:45:47,184 INFO L87 Difference]: Start difference. First operand 175261 states and 185099 transitions. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:49,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:49,939 INFO L93 Difference]: Finished difference Result 348062 states and 367901 transitions. [2025-03-03 10:45:49,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:49,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 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 601 [2025-03-03 10:45:49,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:50,140 INFO L225 Difference]: With dead ends: 348062 [2025-03-03 10:45:50,140 INFO L226 Difference]: Without dead ends: 173590 [2025-03-03 10:45:50,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 600 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:45:50,248 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 970 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2246 mSolverCounterSat, 729 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 2975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 729 IncrementalHoareTripleChecker+Valid, 2246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:50,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 354 Invalid, 2975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [729 Valid, 2246 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:45:50,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173590 states. [2025-03-03 10:45:51,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173590 to 172016. [2025-03-03 10:45:51,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172016 states, 172015 states have (on average 1.0493561607999302) internal successors, (180505), 172015 states have internal predecessors, (180505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:52,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172016 states to 172016 states and 180505 transitions. [2025-03-03 10:45:52,109 INFO L78 Accepts]: Start accepts. Automaton has 172016 states and 180505 transitions. Word has length 601 [2025-03-03 10:45:52,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:52,110 INFO L471 AbstractCegarLoop]: Abstraction has 172016 states and 180505 transitions. [2025-03-03 10:45:52,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:52,110 INFO L276 IsEmpty]: Start isEmpty. Operand 172016 states and 180505 transitions. [2025-03-03 10:45:52,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2025-03-03 10:45:52,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:52,125 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, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:52,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 10:45:52,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 10:45:52,326 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:52,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:52,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1806490214, now seen corresponding path program 1 times [2025-03-03 10:45:52,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:52,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500897156] [2025-03-03 10:45:52,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:52,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:52,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes. [2025-03-03 10:45:52,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements. [2025-03-03 10:45:52,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:52,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:52,541 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 542 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-03 10:45:52,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:52,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500897156] [2025-03-03 10:45:52,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500897156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:52,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:52,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:52,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652032196] [2025-03-03 10:45:52,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:52,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:52,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:52,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:52,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:52,543 INFO L87 Difference]: Start difference. First operand 172016 states and 180505 transitions. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:55,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:55,671 INFO L93 Difference]: Finished difference Result 337721 states and 354305 transitions. [2025-03-03 10:45:55,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:55,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 623 [2025-03-03 10:45:55,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:55,870 INFO L225 Difference]: With dead ends: 337721 [2025-03-03 10:45:55,870 INFO L226 Difference]: Without dead ends: 166494 [2025-03-03 10:45:55,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:55,930 INFO L435 NwaCegarLoop]: 1650 mSDtfsCounter, 791 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 2426 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 1778 SdHoareTripleChecker+Invalid, 2824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 2426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:55,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 1778 Invalid, 2824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 2426 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]