./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label31.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label31.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 af3862af5b8a27b2989fe566f1104f15a4544b51e9167db28055ff534e84b220 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:10:19,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:10:19,439 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:10:19,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:10:19,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:10:19,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:10:19,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:10:19,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:10:19,466 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:10:19,466 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:10:19,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:10:19,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:10:19,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:10:19,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:10:19,468 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:10:19,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:10:19,468 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:10:19,468 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:10:19,468 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:10:19,469 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:10:19,469 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:10:19,469 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:10:19,469 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:10:19,469 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:10:19,469 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:10:19,469 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:10:19,469 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:10:19,469 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:10:19,469 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:10:19,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:10:19,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:10:19,470 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:10:19,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:10:19,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:10:19,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:10:19,470 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:10:19,470 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:10:19,470 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:10:19,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:10:19,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:10:19,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:10:19,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:10:19,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:10:19,471 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 -> af3862af5b8a27b2989fe566f1104f15a4544b51e9167db28055ff534e84b220 [2025-03-08 02:10:19,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:10:19,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:10:19,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:10:19,725 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:10:19,725 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:10:19,726 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label31.c [2025-03-08 02:10:20,897 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7f7ac6da/0b594840078546578092e2fe253ecd5c/FLAGc2551deea [2025-03-08 02:10:21,319 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:10:21,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label31.c [2025-03-08 02:10:21,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7f7ac6da/0b594840078546578092e2fe253ecd5c/FLAGc2551deea [2025-03-08 02:10:21,365 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7f7ac6da/0b594840078546578092e2fe253ecd5c [2025-03-08 02:10:21,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:10:21,368 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:10:21,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:10:21,372 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:10:21,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:10:21,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:10:21" (1/1) ... [2025-03-08 02:10:21,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f9e4635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:21, skipping insertion in model container [2025-03-08 02:10:21,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:10:21" (1/1) ... [2025-03-08 02:10:21,446 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:10:21,607 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label31.c[1403,1416] [2025-03-08 02:10:22,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:10:22,016 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:10:22,026 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label31.c[1403,1416] [2025-03-08 02:10:22,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:10:22,241 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:10:22,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:22 WrapperNode [2025-03-08 02:10:22,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:10:22,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:10:22,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:10:22,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:10:22,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:22" (1/1) ... [2025-03-08 02:10:22,293 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:22" (1/1) ... [2025-03-08 02:10:22,503 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-08 02:10:22,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:10:22,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:10:22,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:10:22,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:10:22,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:22" (1/1) ... [2025-03-08 02:10:22,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:22" (1/1) ... [2025-03-08 02:10:22,611 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:22" (1/1) ... [2025-03-08 02:10:22,743 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-08 02:10:22,743 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:22" (1/1) ... [2025-03-08 02:10:22,743 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:22" (1/1) ... [2025-03-08 02:10:22,866 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:22" (1/1) ... [2025-03-08 02:10:22,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:22" (1/1) ... [2025-03-08 02:10:22,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:22" (1/1) ... [2025-03-08 02:10:22,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:22" (1/1) ... [2025-03-08 02:10:22,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:10:22,974 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:10:22,974 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:10:22,974 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:10:22,975 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:22" (1/1) ... [2025-03-08 02:10:22,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:10:22,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:10:22,999 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-08 02:10:23,002 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-08 02:10:23,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:10:23,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:10:23,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:10:23,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:10:23,071 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:10:23,072 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:10:25,838 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-08 02:10:25,958 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-08 02:10:25,959 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:10:25,978 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:10:25,979 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:10:25,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:10:25 BoogieIcfgContainer [2025-03-08 02:10:25,979 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:10:25,984 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:10:25,985 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:10:25,988 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:10:25,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:10:21" (1/3) ... [2025-03-08 02:10:25,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0ebb1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:10:25, skipping insertion in model container [2025-03-08 02:10:25,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:10:22" (2/3) ... [2025-03-08 02:10:25,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0ebb1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:10:25, skipping insertion in model container [2025-03-08 02:10:25,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:10:25" (3/3) ... [2025-03-08 02:10:25,990 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label31.c [2025-03-08 02:10:26,002 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:10:26,004 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label31.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:10:26,065 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:10:26,076 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;@490abeda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:10:26,077 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:10:26,083 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:26,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 02:10:26,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:26,088 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:26,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:26,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:26,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1457577979, now seen corresponding path program 1 times [2025-03-08 02:10:26,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:26,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704108740] [2025-03-08 02:10:26,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:26,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:26,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 02:10:26,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 02:10:26,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:26,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:26,241 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-08 02:10:26,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:26,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704108740] [2025-03-08 02:10:26,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704108740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:26,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:26,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:10:26,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534480624] [2025-03-08 02:10:26,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:26,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:26,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:26,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:26,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:26,260 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 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-08 02:10:28,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:28,344 INFO L93 Difference]: Finished difference Result 1644 states and 3026 transitions. [2025-03-08 02:10:28,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:28,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-03-08 02:10:28,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:28,358 INFO L225 Difference]: With dead ends: 1644 [2025-03-08 02:10:28,358 INFO L226 Difference]: Without dead ends: 977 [2025-03-08 02:10:28,361 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-08 02:10:28,363 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 480 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:28,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 02:10:28,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-03-08 02:10:28,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2025-03-08 02:10:28,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:28,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2025-03-08 02:10:28,442 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 8 [2025-03-08 02:10:28,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:28,442 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2025-03-08 02:10:28,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 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-08 02:10:28,442 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2025-03-08 02:10:28,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 02:10:28,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:28,444 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:28,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:10:28,445 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:28,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:28,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1617697405, now seen corresponding path program 1 times [2025-03-08 02:10:28,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:28,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009187252] [2025-03-08 02:10:28,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:28,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:28,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 02:10:28,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 02:10:28,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:28,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:28,698 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:10:28,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:28,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009187252] [2025-03-08 02:10:28,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009187252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:28,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:28,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:10:28,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459347511] [2025-03-08 02:10:28,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:28,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:28,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:28,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:28,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:28,701 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-08 02:10:30,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:30,522 INFO L93 Difference]: Finished difference Result 2813 states and 4381 transitions. [2025-03-08 02:10:30,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:30,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-03-08 02:10:30,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:30,529 INFO L225 Difference]: With dead ends: 2813 [2025-03-08 02:10:30,529 INFO L226 Difference]: Without dead ends: 1844 [2025-03-08 02:10:30,531 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-08 02:10:30,532 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:30,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 580 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 02:10:30,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-03-08 02:10:30,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1841. [2025-03-08 02:10:30,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.35) internal successors, (2484), 1840 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:30,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2484 transitions. [2025-03-08 02:10:30,597 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2484 transitions. Word has length 75 [2025-03-08 02:10:30,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:30,598 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2484 transitions. [2025-03-08 02:10:30,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-08 02:10:30,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2484 transitions. [2025-03-08 02:10:30,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 02:10:30,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:30,599 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:30,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:10:30,600 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:30,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:30,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1235128227, now seen corresponding path program 1 times [2025-03-08 02:10:30,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:30,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971109383] [2025-03-08 02:10:30,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:30,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:30,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 02:10:30,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 02:10:30,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:30,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:10:30,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:30,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971109383] [2025-03-08 02:10:30,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971109383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:30,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:30,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:30,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148918950] [2025-03-08 02:10:30,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:30,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:10:30,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:30,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:10:30,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:10:30,857 INFO L87 Difference]: Start difference. First operand 1841 states and 2484 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 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-08 02:10:33,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:33,675 INFO L93 Difference]: Finished difference Result 5863 states and 8156 transitions. [2025-03-08 02:10:33,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:10:33,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-03-08 02:10:33,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:33,687 INFO L225 Difference]: With dead ends: 5863 [2025-03-08 02:10:33,687 INFO L226 Difference]: Without dead ends: 4024 [2025-03-08 02:10:33,690 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-08 02:10:33,691 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 972 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2906 mSolverCounterSat, 697 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 3603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 697 IncrementalHoareTripleChecker+Valid, 2906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:33,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 437 Invalid, 3603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [697 Valid, 2906 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 02:10:33,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2025-03-08 02:10:33,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 4020. [2025-03-08 02:10:33,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4020 states, 4019 states have (on average 1.3262005473998506) internal successors, (5330), 4019 states have internal predecessors, (5330), 0 states have call successors, (0), 0 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-08 02:10:33,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4020 states to 4020 states and 5330 transitions. [2025-03-08 02:10:33,765 INFO L78 Accepts]: Start accepts. Automaton has 4020 states and 5330 transitions. Word has length 78 [2025-03-08 02:10:33,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:33,766 INFO L471 AbstractCegarLoop]: Abstraction has 4020 states and 5330 transitions. [2025-03-08 02:10:33,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 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-08 02:10:33,767 INFO L276 IsEmpty]: Start isEmpty. Operand 4020 states and 5330 transitions. [2025-03-08 02:10:33,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 02:10:33,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:33,770 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:33,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:10:33,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:33,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:33,772 INFO L85 PathProgramCache]: Analyzing trace with hash -275490374, now seen corresponding path program 1 times [2025-03-08 02:10:33,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:33,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231967803] [2025-03-08 02:10:33,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:33,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:33,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 02:10:33,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 02:10:33,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:33,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:34,008 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-08 02:10:34,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:34,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231967803] [2025-03-08 02:10:34,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231967803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:34,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:34,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:10:34,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788851240] [2025-03-08 02:10:34,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:34,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:34,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:34,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:34,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:34,011 INFO L87 Difference]: Start difference. First operand 4020 states and 5330 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 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-08 02:10:35,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:35,328 INFO L93 Difference]: Finished difference Result 10602 states and 14364 transitions. [2025-03-08 02:10:35,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:35,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 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-08 02:10:35,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:35,349 INFO L225 Difference]: With dead ends: 10602 [2025-03-08 02:10:35,350 INFO L226 Difference]: Without dead ends: 6580 [2025-03-08 02:10:35,355 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-08 02:10:35,357 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:35,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:10:35,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6580 states. [2025-03-08 02:10:35,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6580 to 5305. [2025-03-08 02:10:35,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5305 states, 5304 states have (on average 1.2268099547511313) internal successors, (6507), 5304 states have internal predecessors, (6507), 0 states have call successors, (0), 0 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-08 02:10:35,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5305 states to 5305 states and 6507 transitions. [2025-03-08 02:10:35,443 INFO L78 Accepts]: Start accepts. Automaton has 5305 states and 6507 transitions. Word has length 143 [2025-03-08 02:10:35,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:35,443 INFO L471 AbstractCegarLoop]: Abstraction has 5305 states and 6507 transitions. [2025-03-08 02:10:35,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 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-08 02:10:35,444 INFO L276 IsEmpty]: Start isEmpty. Operand 5305 states and 6507 transitions. [2025-03-08 02:10:35,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 02:10:35,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:35,448 INFO L218 NwaCegarLoop]: trace histogram [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, 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-08 02:10:35,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:10:35,448 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:35,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:35,448 INFO L85 PathProgramCache]: Analyzing trace with hash 806657706, now seen corresponding path program 1 times [2025-03-08 02:10:35,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:35,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269507462] [2025-03-08 02:10:35,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:35,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:35,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 02:10:35,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 02:10:35,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:35,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:35,655 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:10:35,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:35,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269507462] [2025-03-08 02:10:35,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269507462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:35,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:35,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:35,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039947617] [2025-03-08 02:10:35,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:35,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:35,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:35,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:35,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:35,657 INFO L87 Difference]: Start difference. First operand 5305 states and 6507 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 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-08 02:10:37,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:37,037 INFO L93 Difference]: Finished difference Result 13165 states and 16536 transitions. [2025-03-08 02:10:37,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:37,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2025-03-08 02:10:37,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:37,056 INFO L225 Difference]: With dead ends: 13165 [2025-03-08 02:10:37,056 INFO L226 Difference]: Without dead ends: 7862 [2025-03-08 02:10:37,062 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-08 02:10:37,063 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 500 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:37,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 808 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:10:37,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7862 states. [2025-03-08 02:10:37,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7862 to 7862. [2025-03-08 02:10:37,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7862 states, 7861 states have (on average 1.2101513802315227) internal successors, (9513), 7861 states have internal predecessors, (9513), 0 states have call successors, (0), 0 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-08 02:10:37,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7862 states to 7862 states and 9513 transitions. [2025-03-08 02:10:37,174 INFO L78 Accepts]: Start accepts. Automaton has 7862 states and 9513 transitions. Word has length 156 [2025-03-08 02:10:37,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:37,175 INFO L471 AbstractCegarLoop]: Abstraction has 7862 states and 9513 transitions. [2025-03-08 02:10:37,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 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-08 02:10:37,175 INFO L276 IsEmpty]: Start isEmpty. Operand 7862 states and 9513 transitions. [2025-03-08 02:10:37,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-08 02:10:37,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:37,177 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-08 02:10:37,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:10:37,177 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:37,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:37,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1672746228, now seen corresponding path program 1 times [2025-03-08 02:10:37,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:37,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169578855] [2025-03-08 02:10:37,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:37,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:37,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-08 02:10:37,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-08 02:10:37,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:37,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:37,392 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2025-03-08 02:10:37,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:37,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169578855] [2025-03-08 02:10:37,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169578855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:37,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:37,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:37,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176223746] [2025-03-08 02:10:37,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:37,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:37,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:37,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:37,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:37,396 INFO L87 Difference]: Start difference. First operand 7862 states and 9513 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 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-08 02:10:38,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:38,913 INFO L93 Difference]: Finished difference Result 19110 states and 23099 transitions. [2025-03-08 02:10:38,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:38,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 261 [2025-03-08 02:10:38,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:38,936 INFO L225 Difference]: With dead ends: 19110 [2025-03-08 02:10:38,936 INFO L226 Difference]: Without dead ends: 10400 [2025-03-08 02:10:38,943 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-08 02:10:38,943 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 436 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:38,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 952 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:10:38,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10400 states. [2025-03-08 02:10:39,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10400 to 7415. [2025-03-08 02:10:39,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7415 states, 7414 states have (on average 1.1657674669544105) internal successors, (8643), 7414 states have internal predecessors, (8643), 0 states have call successors, (0), 0 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-08 02:10:39,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7415 states to 7415 states and 8643 transitions. [2025-03-08 02:10:39,044 INFO L78 Accepts]: Start accepts. Automaton has 7415 states and 8643 transitions. Word has length 261 [2025-03-08 02:10:39,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:39,044 INFO L471 AbstractCegarLoop]: Abstraction has 7415 states and 8643 transitions. [2025-03-08 02:10:39,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 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-08 02:10:39,044 INFO L276 IsEmpty]: Start isEmpty. Operand 7415 states and 8643 transitions. [2025-03-08 02:10:39,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-03-08 02:10:39,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:39,075 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:39,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:10:39,076 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:39,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:39,077 INFO L85 PathProgramCache]: Analyzing trace with hash -644888150, now seen corresponding path program 1 times [2025-03-08 02:10:39,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:39,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439449727] [2025-03-08 02:10:39,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:39,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:39,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-08 02:10:39,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-08 02:10:39,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:39,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:39,209 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2025-03-08 02:10:39,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:39,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439449727] [2025-03-08 02:10:39,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439449727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:39,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:39,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:39,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294075143] [2025-03-08 02:10:39,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:39,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:39,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:39,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:39,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:39,210 INFO L87 Difference]: Start difference. First operand 7415 states and 8643 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 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-08 02:10:40,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:40,573 INFO L93 Difference]: Finished difference Result 18651 states and 21996 transitions. [2025-03-08 02:10:40,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:40,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 265 [2025-03-08 02:10:40,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:40,593 INFO L225 Difference]: With dead ends: 18651 [2025-03-08 02:10:40,593 INFO L226 Difference]: Without dead ends: 11237 [2025-03-08 02:10:40,601 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-08 02:10:40,601 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 452 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:40,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 426 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:10:40,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11237 states. [2025-03-08 02:10:40,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11237 to 8667. [2025-03-08 02:10:40,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8667 states, 8666 states have (on average 1.1520886222017077) internal successors, (9984), 8666 states have internal predecessors, (9984), 0 states have call successors, (0), 0 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-08 02:10:40,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8667 states to 8667 states and 9984 transitions. [2025-03-08 02:10:40,695 INFO L78 Accepts]: Start accepts. Automaton has 8667 states and 9984 transitions. Word has length 265 [2025-03-08 02:10:40,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:40,695 INFO L471 AbstractCegarLoop]: Abstraction has 8667 states and 9984 transitions. [2025-03-08 02:10:40,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 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-08 02:10:40,696 INFO L276 IsEmpty]: Start isEmpty. Operand 8667 states and 9984 transitions. [2025-03-08 02:10:40,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-08 02:10:40,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:40,703 INFO L218 NwaCegarLoop]: trace histogram [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, 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-08 02:10:40,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 02:10:40,703 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:40,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:40,704 INFO L85 PathProgramCache]: Analyzing trace with hash 956939334, now seen corresponding path program 1 times [2025-03-08 02:10:40,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:40,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487778206] [2025-03-08 02:10:40,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:40,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:40,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-08 02:10:40,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-08 02:10:40,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:40,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:40,937 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-08 02:10:40,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:40,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487778206] [2025-03-08 02:10:40,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487778206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:40,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:40,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:40,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432917657] [2025-03-08 02:10:40,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:40,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:40,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:40,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:40,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:40,939 INFO L87 Difference]: Start difference. First operand 8667 states and 9984 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 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-08 02:10:42,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:42,354 INFO L93 Difference]: Finished difference Result 22011 states and 25365 transitions. [2025-03-08 02:10:42,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:42,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 278 [2025-03-08 02:10:42,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:42,376 INFO L225 Difference]: With dead ends: 22011 [2025-03-08 02:10:42,376 INFO L226 Difference]: Without dead ends: 13346 [2025-03-08 02:10:42,385 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-08 02:10:42,385 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 484 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:42,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 396 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:10:42,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13346 states. [2025-03-08 02:10:42,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13346 to 11642. [2025-03-08 02:10:42,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11642 states, 11641 states have (on average 1.1441456919508632) internal successors, (13319), 11641 states have internal predecessors, (13319), 0 states have call successors, (0), 0 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-08 02:10:42,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11642 states to 11642 states and 13319 transitions. [2025-03-08 02:10:42,490 INFO L78 Accepts]: Start accepts. Automaton has 11642 states and 13319 transitions. Word has length 278 [2025-03-08 02:10:42,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:42,491 INFO L471 AbstractCegarLoop]: Abstraction has 11642 states and 13319 transitions. [2025-03-08 02:10:42,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 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-08 02:10:42,492 INFO L276 IsEmpty]: Start isEmpty. Operand 11642 states and 13319 transitions. [2025-03-08 02:10:42,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-03-08 02:10:42,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:42,497 INFO L218 NwaCegarLoop]: trace histogram [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, 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-08 02:10:42,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:10:42,497 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:42,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:42,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1941416717, now seen corresponding path program 1 times [2025-03-08 02:10:42,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:42,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654379888] [2025-03-08 02:10:42,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:42,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:42,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-03-08 02:10:42,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-03-08 02:10:42,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:42,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:42,797 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 02:10:42,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:42,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654379888] [2025-03-08 02:10:42,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654379888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:42,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:42,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:42,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529301260] [2025-03-08 02:10:42,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:42,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:42,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:42,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:42,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:42,799 INFO L87 Difference]: Start difference. First operand 11642 states and 13319 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 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-08 02:10:44,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:44,240 INFO L93 Difference]: Finished difference Result 28847 states and 33336 transitions. [2025-03-08 02:10:44,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:44,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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 322 [2025-03-08 02:10:44,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:44,264 INFO L225 Difference]: With dead ends: 28847 [2025-03-08 02:10:44,264 INFO L226 Difference]: Without dead ends: 16782 [2025-03-08 02:10:44,276 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-08 02:10:44,279 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 382 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:44,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 915 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:10:44,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16782 states. [2025-03-08 02:10:44,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16782 to 16349. [2025-03-08 02:10:44,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16349 states, 16348 states have (on average 1.1292512845608025) internal successors, (18461), 16348 states have internal predecessors, (18461), 0 states have call successors, (0), 0 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-08 02:10:44,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16349 states to 16349 states and 18461 transitions. [2025-03-08 02:10:44,467 INFO L78 Accepts]: Start accepts. Automaton has 16349 states and 18461 transitions. Word has length 322 [2025-03-08 02:10:44,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:44,467 INFO L471 AbstractCegarLoop]: Abstraction has 16349 states and 18461 transitions. [2025-03-08 02:10:44,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 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-08 02:10:44,467 INFO L276 IsEmpty]: Start isEmpty. Operand 16349 states and 18461 transitions. [2025-03-08 02:10:44,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-08 02:10:44,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:44,471 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:44,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 02:10:44,472 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:44,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:44,473 INFO L85 PathProgramCache]: Analyzing trace with hash -712640351, now seen corresponding path program 1 times [2025-03-08 02:10:44,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:44,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037709384] [2025-03-08 02:10:44,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:44,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:44,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-08 02:10:44,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-08 02:10:44,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:44,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 02:10:44,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:44,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037709384] [2025-03-08 02:10:44,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037709384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:44,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:44,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:44,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877688068] [2025-03-08 02:10:44,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:44,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:44,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:44,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:44,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:44,695 INFO L87 Difference]: Start difference. First operand 16349 states and 18461 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 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-08 02:10:46,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:46,181 INFO L93 Difference]: Finished difference Result 39113 states and 44253 transitions. [2025-03-08 02:10:46,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:46,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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 329 [2025-03-08 02:10:46,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:46,206 INFO L225 Difference]: With dead ends: 39113 [2025-03-08 02:10:46,206 INFO L226 Difference]: Without dead ends: 22333 [2025-03-08 02:10:46,219 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-08 02:10:46,219 INFO L435 NwaCegarLoop]: 716 mSDtfsCounter, 393 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:46,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 772 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:10:46,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22333 states. [2025-03-08 02:10:46,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22333 to 19346. [2025-03-08 02:10:46,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19346 states, 19345 states have (on average 1.1327991729128974) internal successors, (21914), 19345 states have internal predecessors, (21914), 0 states have call successors, (0), 0 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-08 02:10:46,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19346 states to 19346 states and 21914 transitions. [2025-03-08 02:10:46,385 INFO L78 Accepts]: Start accepts. Automaton has 19346 states and 21914 transitions. Word has length 329 [2025-03-08 02:10:46,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:46,386 INFO L471 AbstractCegarLoop]: Abstraction has 19346 states and 21914 transitions. [2025-03-08 02:10:46,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 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-08 02:10:46,386 INFO L276 IsEmpty]: Start isEmpty. Operand 19346 states and 21914 transitions. [2025-03-08 02:10:46,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-08 02:10:46,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:46,391 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:46,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 02:10:46,391 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:46,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:46,392 INFO L85 PathProgramCache]: Analyzing trace with hash -690835645, now seen corresponding path program 1 times [2025-03-08 02:10:46,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:46,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876588627] [2025-03-08 02:10:46,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:46,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:46,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-08 02:10:46,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-08 02:10:46,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:46,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:46,629 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-03-08 02:10:46,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:46,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876588627] [2025-03-08 02:10:46,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876588627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:46,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:46,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:46,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009547147] [2025-03-08 02:10:46,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:46,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:46,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:46,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:46,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:46,630 INFO L87 Difference]: Start difference. First operand 19346 states and 21914 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:48,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:48,238 INFO L93 Difference]: Finished difference Result 45075 states and 51541 transitions. [2025-03-08 02:10:48,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:48,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 403 [2025-03-08 02:10:48,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:48,271 INFO L225 Difference]: With dead ends: 45075 [2025-03-08 02:10:48,272 INFO L226 Difference]: Without dead ends: 25306 [2025-03-08 02:10:48,286 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-08 02:10:48,287 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 341 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:48,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 791 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 02:10:48,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25306 states. [2025-03-08 02:10:48,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25306 to 19320. [2025-03-08 02:10:48,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19320 states, 19319 states have (on average 1.132512034784409) internal successors, (21879), 19319 states have internal predecessors, (21879), 0 states have call successors, (0), 0 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-08 02:10:48,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19320 states to 19320 states and 21879 transitions. [2025-03-08 02:10:48,511 INFO L78 Accepts]: Start accepts. Automaton has 19320 states and 21879 transitions. Word has length 403 [2025-03-08 02:10:48,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:48,512 INFO L471 AbstractCegarLoop]: Abstraction has 19320 states and 21879 transitions. [2025-03-08 02:10:48,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:48,512 INFO L276 IsEmpty]: Start isEmpty. Operand 19320 states and 21879 transitions. [2025-03-08 02:10:48,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-03-08 02:10:48,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:48,518 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:48,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 02:10:48,518 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:48,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:48,519 INFO L85 PathProgramCache]: Analyzing trace with hash 874822156, now seen corresponding path program 1 times [2025-03-08 02:10:48,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:48,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262817847] [2025-03-08 02:10:48,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:48,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:48,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-08 02:10:48,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-08 02:10:48,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:48,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:48,808 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 443 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-03-08 02:10:48,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:48,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262817847] [2025-03-08 02:10:48,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262817847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:48,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:48,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:48,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668110571] [2025-03-08 02:10:48,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:48,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:48,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:48,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:48,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:48,810 INFO L87 Difference]: Start difference. First operand 19320 states and 21879 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:50,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:50,249 INFO L93 Difference]: Finished difference Result 47156 states and 53418 transitions. [2025-03-08 02:10:50,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:50,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 404 [2025-03-08 02:10:50,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:50,276 INFO L225 Difference]: With dead ends: 47156 [2025-03-08 02:10:50,276 INFO L226 Difference]: Without dead ends: 26977 [2025-03-08 02:10:50,292 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-08 02:10:50,292 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 446 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:50,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 663 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:10:50,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26977 states. [2025-03-08 02:10:50,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26977 to 24414. [2025-03-08 02:10:50,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24414 states, 24413 states have (on average 1.1234997747101954) internal successors, (27428), 24413 states have internal predecessors, (27428), 0 states have call successors, (0), 0 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-08 02:10:50,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24414 states to 24414 states and 27428 transitions. [2025-03-08 02:10:50,491 INFO L78 Accepts]: Start accepts. Automaton has 24414 states and 27428 transitions. Word has length 404 [2025-03-08 02:10:50,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:50,492 INFO L471 AbstractCegarLoop]: Abstraction has 24414 states and 27428 transitions. [2025-03-08 02:10:50,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:50,492 INFO L276 IsEmpty]: Start isEmpty. Operand 24414 states and 27428 transitions. [2025-03-08 02:10:50,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-08 02:10:50,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:50,497 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:50,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 02:10:50,497 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:50,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:50,498 INFO L85 PathProgramCache]: Analyzing trace with hash 811050599, now seen corresponding path program 1 times [2025-03-08 02:10:50,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:50,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604254145] [2025-03-08 02:10:50,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:50,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:50,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-08 02:10:50,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-08 02:10:50,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:50,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:50,837 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 522 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 02:10:50,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:50,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604254145] [2025-03-08 02:10:50,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604254145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:50,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:50,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:10:50,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493230059] [2025-03-08 02:10:50,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:50,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:10:50,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:50,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:10:50,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:10:50,840 INFO L87 Difference]: Start difference. First operand 24414 states and 27428 transitions. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:53,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:53,115 INFO L93 Difference]: Finished difference Result 62487 states and 70116 transitions. [2025-03-08 02:10:53,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:10:53,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 408 [2025-03-08 02:10:53,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:53,159 INFO L225 Difference]: With dead ends: 62487 [2025-03-08 02:10:53,160 INFO L226 Difference]: Without dead ends: 38075 [2025-03-08 02:10:53,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:10:53,177 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 826 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 2862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:53,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 211 Invalid, 2862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 02:10:53,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38075 states. [2025-03-08 02:10:53,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38075 to 34226. [2025-03-08 02:10:53,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34226 states, 34225 states have (on average 1.1238860482103725) internal successors, (38465), 34225 states have internal predecessors, (38465), 0 states have call successors, (0), 0 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-08 02:10:53,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34226 states to 34226 states and 38465 transitions. [2025-03-08 02:10:53,473 INFO L78 Accepts]: Start accepts. Automaton has 34226 states and 38465 transitions. Word has length 408 [2025-03-08 02:10:53,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:53,473 INFO L471 AbstractCegarLoop]: Abstraction has 34226 states and 38465 transitions. [2025-03-08 02:10:53,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:53,474 INFO L276 IsEmpty]: Start isEmpty. Operand 34226 states and 38465 transitions. [2025-03-08 02:10:53,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-03-08 02:10:53,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:53,478 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:53,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 02:10:53,478 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:53,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:53,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1464025927, now seen corresponding path program 1 times [2025-03-08 02:10:53,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:53,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887939503] [2025-03-08 02:10:53,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:53,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:53,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-03-08 02:10:53,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-03-08 02:10:53,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:53,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:53,760 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-08 02:10:53,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:53,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887939503] [2025-03-08 02:10:53,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887939503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:53,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:53,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:53,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870910994] [2025-03-08 02:10:53,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:53,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:53,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:53,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:53,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:53,764 INFO L87 Difference]: Start difference. First operand 34226 states and 38465 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:55,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:55,248 INFO L93 Difference]: Finished difference Result 77395 states and 87186 transitions. [2025-03-08 02:10:55,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:55,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 427 [2025-03-08 02:10:55,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:55,293 INFO L225 Difference]: With dead ends: 77395 [2025-03-08 02:10:55,294 INFO L226 Difference]: Without dead ends: 43171 [2025-03-08 02:10:55,317 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-08 02:10:55,317 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 393 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:55,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 335 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:10:55,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43171 states. [2025-03-08 02:10:55,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43171 to 42736. [2025-03-08 02:10:55,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42736 states, 42735 states have (on average 1.1186381186381187) internal successors, (47805), 42735 states have internal predecessors, (47805), 0 states have call successors, (0), 0 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-08 02:10:55,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42736 states to 42736 states and 47805 transitions. [2025-03-08 02:10:55,885 INFO L78 Accepts]: Start accepts. Automaton has 42736 states and 47805 transitions. Word has length 427 [2025-03-08 02:10:55,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:55,885 INFO L471 AbstractCegarLoop]: Abstraction has 42736 states and 47805 transitions. [2025-03-08 02:10:55,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:55,885 INFO L276 IsEmpty]: Start isEmpty. Operand 42736 states and 47805 transitions. [2025-03-08 02:10:55,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-03-08 02:10:55,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:55,890 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:55,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 02:10:55,890 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:55,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:55,890 INFO L85 PathProgramCache]: Analyzing trace with hash -325549135, now seen corresponding path program 1 times [2025-03-08 02:10:55,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:55,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071477634] [2025-03-08 02:10:55,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:55,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:55,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-08 02:10:55,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-08 02:10:55,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:55,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:56,187 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 460 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-08 02:10:56,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:56,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071477634] [2025-03-08 02:10:56,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071477634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:56,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:56,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:56,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73355590] [2025-03-08 02:10:56,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:56,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:56,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:56,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:56,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:56,188 INFO L87 Difference]: Start difference. First operand 42736 states and 47805 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:57,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:57,731 INFO L93 Difference]: Finished difference Result 98672 states and 109854 transitions. [2025-03-08 02:10:57,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:57,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 428 [2025-03-08 02:10:57,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:57,792 INFO L225 Difference]: With dead ends: 98672 [2025-03-08 02:10:57,792 INFO L226 Difference]: Without dead ends: 55086 [2025-03-08 02:10:57,815 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-08 02:10:57,815 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 372 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:57,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 826 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1321 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:10:57,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55086 states. [2025-03-08 02:10:58,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55086 to 52941. [2025-03-08 02:10:58,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52941 states, 52940 states have (on average 1.1039478655081223) internal successors, (58443), 52940 states have internal predecessors, (58443), 0 states have call successors, (0), 0 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-08 02:10:58,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52941 states to 52941 states and 58443 transitions. [2025-03-08 02:10:58,292 INFO L78 Accepts]: Start accepts. Automaton has 52941 states and 58443 transitions. Word has length 428 [2025-03-08 02:10:58,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:58,292 INFO L471 AbstractCegarLoop]: Abstraction has 52941 states and 58443 transitions. [2025-03-08 02:10:58,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:10:58,292 INFO L276 IsEmpty]: Start isEmpty. Operand 52941 states and 58443 transitions. [2025-03-08 02:10:58,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2025-03-08 02:10:58,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:58,297 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-08 02:10:58,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 02:10:58,297 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:58,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:58,298 INFO L85 PathProgramCache]: Analyzing trace with hash 587520287, now seen corresponding path program 1 times [2025-03-08 02:10:58,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:58,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940879714] [2025-03-08 02:10:58,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:58,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:58,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-03-08 02:10:58,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-03-08 02:10:58,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:58,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:58,594 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-08 02:10:58,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:58,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940879714] [2025-03-08 02:10:58,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940879714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:58,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:58,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:58,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308159290] [2025-03-08 02:10:58,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:58,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:58,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:58,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:58,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:58,596 INFO L87 Difference]: Start difference. First operand 52941 states and 58443 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 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-08 02:11:00,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:00,203 INFO L93 Difference]: Finished difference Result 113563 states and 125554 transitions. [2025-03-08 02:11:00,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:00,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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 451 [2025-03-08 02:11:00,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:00,276 INFO L225 Difference]: With dead ends: 113563 [2025-03-08 02:11:00,276 INFO L226 Difference]: Without dead ends: 60195 [2025-03-08 02:11:00,292 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-08 02:11:00,293 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 428 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:00,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 266 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:11:00,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60195 states. [2025-03-08 02:11:00,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60195 to 58471. [2025-03-08 02:11:00,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58471 states, 58470 states have (on average 1.104361210877373) internal successors, (64572), 58470 states have internal predecessors, (64572), 0 states have call successors, (0), 0 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-08 02:11:00,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58471 states to 58471 states and 64572 transitions. [2025-03-08 02:11:00,953 INFO L78 Accepts]: Start accepts. Automaton has 58471 states and 64572 transitions. Word has length 451 [2025-03-08 02:11:00,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:00,954 INFO L471 AbstractCegarLoop]: Abstraction has 58471 states and 64572 transitions. [2025-03-08 02:11:00,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 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-08 02:11:00,954 INFO L276 IsEmpty]: Start isEmpty. Operand 58471 states and 64572 transitions. [2025-03-08 02:11:00,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2025-03-08 02:11:00,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:00,961 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:00,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 02:11:00,961 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:00,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:00,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1416619832, now seen corresponding path program 1 times [2025-03-08 02:11:00,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:00,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719317829] [2025-03-08 02:11:00,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:00,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:01,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-03-08 02:11:01,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-03-08 02:11:01,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:01,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:01,191 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2025-03-08 02:11:01,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:01,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719317829] [2025-03-08 02:11:01,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719317829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:01,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:01,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:01,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207762239] [2025-03-08 02:11:01,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:01,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:01,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:01,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:01,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:01,193 INFO L87 Difference]: Start difference. First operand 58471 states and 64572 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 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-08 02:11:02,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:02,921 INFO L93 Difference]: Finished difference Result 139069 states and 153533 transitions. [2025-03-08 02:11:02,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:02,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 451 [2025-03-08 02:11:02,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:03,005 INFO L225 Difference]: With dead ends: 139069 [2025-03-08 02:11:03,005 INFO L226 Difference]: Without dead ends: 80600 [2025-03-08 02:11:03,035 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-08 02:11:03,035 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 475 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:03,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 281 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:11:03,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80600 states. [2025-03-08 02:11:03,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80600 to 78444. [2025-03-08 02:11:03,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78444 states, 78443 states have (on average 1.0981604477136264) internal successors, (86143), 78443 states have internal predecessors, (86143), 0 states have call successors, (0), 0 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-08 02:11:03,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78444 states to 78444 states and 86143 transitions. [2025-03-08 02:11:03,717 INFO L78 Accepts]: Start accepts. Automaton has 78444 states and 86143 transitions. Word has length 451 [2025-03-08 02:11:03,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:03,717 INFO L471 AbstractCegarLoop]: Abstraction has 78444 states and 86143 transitions. [2025-03-08 02:11:03,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 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-08 02:11:03,717 INFO L276 IsEmpty]: Start isEmpty. Operand 78444 states and 86143 transitions. [2025-03-08 02:11:03,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2025-03-08 02:11:03,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:03,722 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:03,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 02:11:03,722 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:03,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:03,723 INFO L85 PathProgramCache]: Analyzing trace with hash -157273983, now seen corresponding path program 1 times [2025-03-08 02:11:03,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:03,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487335500] [2025-03-08 02:11:03,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:03,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:03,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-03-08 02:11:03,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-03-08 02:11:03,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:03,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:03,921 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-03-08 02:11:03,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:03,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487335500] [2025-03-08 02:11:03,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487335500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:03,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:03,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:03,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757618353] [2025-03-08 02:11:03,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:03,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:03,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:03,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:03,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:03,922 INFO L87 Difference]: Start difference. First operand 78444 states and 86143 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 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-08 02:11:05,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:05,694 INFO L93 Difference]: Finished difference Result 172219 states and 188927 transitions. [2025-03-08 02:11:05,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:05,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 451 [2025-03-08 02:11:05,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:05,825 INFO L225 Difference]: With dead ends: 172219 [2025-03-08 02:11:05,825 INFO L226 Difference]: Without dead ends: 93349 [2025-03-08 02:11:05,882 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-08 02:11:05,883 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 293 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:05,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 814 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:11:05,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93349 states. [2025-03-08 02:11:06,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93349 to 92055. [2025-03-08 02:11:06,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92055 states, 92054 states have (on average 1.0885893062767507) internal successors, (100209), 92054 states have internal predecessors, (100209), 0 states have call successors, (0), 0 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-08 02:11:06,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92055 states to 92055 states and 100209 transitions. [2025-03-08 02:11:06,880 INFO L78 Accepts]: Start accepts. Automaton has 92055 states and 100209 transitions. Word has length 451 [2025-03-08 02:11:06,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:06,880 INFO L471 AbstractCegarLoop]: Abstraction has 92055 states and 100209 transitions. [2025-03-08 02:11:06,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 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-08 02:11:06,880 INFO L276 IsEmpty]: Start isEmpty. Operand 92055 states and 100209 transitions. [2025-03-08 02:11:06,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-08 02:11:06,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:06,885 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:06,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 02:11:06,885 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:06,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:06,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1032846720, now seen corresponding path program 1 times [2025-03-08 02:11:06,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:06,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453753948] [2025-03-08 02:11:06,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:06,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:07,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-08 02:11:07,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-08 02:11:07,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:07,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:07,342 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 02:11:07,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:07,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453753948] [2025-03-08 02:11:07,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453753948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:07,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:07,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:07,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753415333] [2025-03-08 02:11:07,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:07,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:07,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:07,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:07,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:07,343 INFO L87 Difference]: Start difference. First operand 92055 states and 100209 transitions. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:09,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:09,108 INFO L93 Difference]: Finished difference Result 194757 states and 211861 transitions. [2025-03-08 02:11:09,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:09,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 454 [2025-03-08 02:11:09,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:09,232 INFO L225 Difference]: With dead ends: 194757 [2025-03-08 02:11:09,232 INFO L226 Difference]: Without dead ends: 102279 [2025-03-08 02:11:09,293 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-08 02:11:09,293 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 247 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:09,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 790 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:11:09,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102279 states. [2025-03-08 02:11:10,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102279 to 97591. [2025-03-08 02:11:10,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97591 states, 97590 states have (on average 1.0835229019366739) internal successors, (105741), 97590 states have internal predecessors, (105741), 0 states have call successors, (0), 0 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-08 02:11:10,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97591 states to 97591 states and 105741 transitions. [2025-03-08 02:11:10,831 INFO L78 Accepts]: Start accepts. Automaton has 97591 states and 105741 transitions. Word has length 454 [2025-03-08 02:11:10,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:10,831 INFO L471 AbstractCegarLoop]: Abstraction has 97591 states and 105741 transitions. [2025-03-08 02:11:10,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:10,831 INFO L276 IsEmpty]: Start isEmpty. Operand 97591 states and 105741 transitions. [2025-03-08 02:11:10,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-03-08 02:11:10,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:10,837 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:10,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 02:11:10,837 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:10,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:10,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1914271108, now seen corresponding path program 1 times [2025-03-08 02:11:10,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:10,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298999543] [2025-03-08 02:11:10,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:10,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:10,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 499 statements into 1 equivalence classes. [2025-03-08 02:11:10,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 499 of 499 statements. [2025-03-08 02:11:10,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:10,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:11,202 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 02:11:11,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:11,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298999543] [2025-03-08 02:11:11,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298999543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:11,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:11,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:11,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114999334] [2025-03-08 02:11:11,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:11,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:11,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:11,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:11,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:11,204 INFO L87 Difference]: Start difference. First operand 97591 states and 105741 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 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-08 02:11:13,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:13,053 INFO L93 Difference]: Finished difference Result 207541 states and 225049 transitions. [2025-03-08 02:11:13,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:13,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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 499 [2025-03-08 02:11:13,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:13,206 INFO L225 Difference]: With dead ends: 207541 [2025-03-08 02:11:13,206 INFO L226 Difference]: Without dead ends: 109514 [2025-03-08 02:11:13,253 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-08 02:11:13,253 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 489 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:13,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 698 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:11:13,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109514 states. [2025-03-08 02:11:14,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109514 to 105662. [2025-03-08 02:11:14,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105662 states, 105661 states have (on average 1.0785720369862106) internal successors, (113963), 105661 states have internal predecessors, (113963), 0 states have call successors, (0), 0 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-08 02:11:14,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105662 states to 105662 states and 113963 transitions. [2025-03-08 02:11:14,771 INFO L78 Accepts]: Start accepts. Automaton has 105662 states and 113963 transitions. Word has length 499 [2025-03-08 02:11:14,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:14,772 INFO L471 AbstractCegarLoop]: Abstraction has 105662 states and 113963 transitions. [2025-03-08 02:11:14,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 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-08 02:11:14,772 INFO L276 IsEmpty]: Start isEmpty. Operand 105662 states and 113963 transitions. [2025-03-08 02:11:14,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2025-03-08 02:11:14,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:14,782 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:14,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 02:11:14,783 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:14,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:14,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1992369795, now seen corresponding path program 1 times [2025-03-08 02:11:14,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:14,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637484570] [2025-03-08 02:11:14,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:14,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:14,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 563 statements into 1 equivalence classes. [2025-03-08 02:11:14,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 563 of 563 statements. [2025-03-08 02:11:14,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:14,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:15,121 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-03-08 02:11:15,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:15,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637484570] [2025-03-08 02:11:15,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637484570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:15,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:15,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 02:11:15,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405092512] [2025-03-08 02:11:15,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:15,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 02:11:15,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:15,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 02:11:15,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:11:15,123 INFO L87 Difference]: Start difference. First operand 105662 states and 113963 transitions. Second operand has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:18,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:18,006 INFO L93 Difference]: Finished difference Result 244109 states and 263029 transitions. [2025-03-08 02:11:18,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 02:11:18,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 563 [2025-03-08 02:11:18,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:18,153 INFO L225 Difference]: With dead ends: 244109 [2025-03-08 02:11:18,153 INFO L226 Difference]: Without dead ends: 137596 [2025-03-08 02:11:18,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:11:18,203 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 1267 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 3227 mSolverCounterSat, 571 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 3798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 571 IncrementalHoareTripleChecker+Valid, 3227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:18,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1267 Valid, 227 Invalid, 3798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [571 Valid, 3227 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 02:11:18,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137596 states. [2025-03-08 02:11:19,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137596 to 120559. [2025-03-08 02:11:19,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120559 states, 120558 states have (on average 1.0706713780918728) internal successors, (129078), 120558 states have internal predecessors, (129078), 0 states have call successors, (0), 0 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-08 02:11:19,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120559 states to 120559 states and 129078 transitions. [2025-03-08 02:11:19,763 INFO L78 Accepts]: Start accepts. Automaton has 120559 states and 129078 transitions. Word has length 563 [2025-03-08 02:11:19,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:19,764 INFO L471 AbstractCegarLoop]: Abstraction has 120559 states and 129078 transitions. [2025-03-08 02:11:19,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:19,764 INFO L276 IsEmpty]: Start isEmpty. Operand 120559 states and 129078 transitions. [2025-03-08 02:11:19,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2025-03-08 02:11:19,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:19,779 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:19,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 02:11:19,779 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:19,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:19,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1755751970, now seen corresponding path program 1 times [2025-03-08 02:11:19,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:19,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117112393] [2025-03-08 02:11:19,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:19,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:19,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 563 statements into 1 equivalence classes. [2025-03-08 02:11:19,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 563 of 563 statements. [2025-03-08 02:11:19,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:19,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:20,402 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-03-08 02:11:20,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:20,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117112393] [2025-03-08 02:11:20,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117112393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:20,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:20,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 02:11:20,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825609698] [2025-03-08 02:11:20,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:20,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 02:11:20,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:20,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 02:11:20,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:11:20,405 INFO L87 Difference]: Start difference. First operand 120559 states and 129078 transitions. Second operand has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:23,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:23,391 INFO L93 Difference]: Finished difference Result 274762 states and 294268 transitions. [2025-03-08 02:11:23,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 02:11:23,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 563 [2025-03-08 02:11:23,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:23,572 INFO L225 Difference]: With dead ends: 274762 [2025-03-08 02:11:23,572 INFO L226 Difference]: Without dead ends: 152930 [2025-03-08 02:11:23,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:11:23,635 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 1655 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2758 mSolverCounterSat, 575 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1655 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 3333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 575 IncrementalHoareTripleChecker+Valid, 2758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:23,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1655 Valid, 178 Invalid, 3333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [575 Valid, 2758 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 02:11:23,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152930 states. [2025-03-08 02:11:25,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152930 to 127795. [2025-03-08 02:11:25,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127795 states, 127794 states have (on average 1.0691973019077579) internal successors, (136637), 127794 states have internal predecessors, (136637), 0 states have call successors, (0), 0 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-08 02:11:25,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127795 states to 127795 states and 136637 transitions. [2025-03-08 02:11:25,218 INFO L78 Accepts]: Start accepts. Automaton has 127795 states and 136637 transitions. Word has length 563 [2025-03-08 02:11:25,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:25,219 INFO L471 AbstractCegarLoop]: Abstraction has 127795 states and 136637 transitions. [2025-03-08 02:11:25,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:11:25,219 INFO L276 IsEmpty]: Start isEmpty. Operand 127795 states and 136637 transitions. [2025-03-08 02:11:25,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-03-08 02:11:25,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:25,227 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:25,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 02:11:25,227 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:25,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:25,228 INFO L85 PathProgramCache]: Analyzing trace with hash -208327491, now seen corresponding path program 1 times [2025-03-08 02:11:25,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:25,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551152358] [2025-03-08 02:11:25,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:25,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:25,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-03-08 02:11:25,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-03-08 02:11:25,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:25,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:25,910 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 399 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-03-08 02:11:25,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:25,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551152358] [2025-03-08 02:11:25,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551152358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:25,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:25,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:11:25,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984256946] [2025-03-08 02:11:25,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:25,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:11:25,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:25,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:11:25,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:11:25,911 INFO L87 Difference]: Start difference. First operand 127795 states and 136637 transitions. Second operand has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 0 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-08 02:11:28,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:28,553 INFO L93 Difference]: Finished difference Result 267935 states and 286154 transitions. [2025-03-08 02:11:28,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:11:28,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 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 568 [2025-03-08 02:11:28,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:28,725 INFO L225 Difference]: With dead ends: 267935 [2025-03-08 02:11:28,725 INFO L226 Difference]: Without dead ends: 140142 [2025-03-08 02:11:28,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:11:28,800 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 726 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 2791 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 3095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 2791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:28,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 338 Invalid, 3095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 2791 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 02:11:28,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140142 states. [2025-03-08 02:11:30,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140142 to 136733. [2025-03-08 02:11:30,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136733 states, 136732 states have (on average 1.0627870578942749) internal successors, (145317), 136732 states have internal predecessors, (145317), 0 states have call successors, (0), 0 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-08 02:11:30,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136733 states to 136733 states and 145317 transitions. [2025-03-08 02:11:30,599 INFO L78 Accepts]: Start accepts. Automaton has 136733 states and 145317 transitions. Word has length 568 [2025-03-08 02:11:30,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:30,600 INFO L471 AbstractCegarLoop]: Abstraction has 136733 states and 145317 transitions. [2025-03-08 02:11:30,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.5) internal successors, (370), 4 states have internal predecessors, (370), 0 states have call successors, (0), 0 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-08 02:11:30,600 INFO L276 IsEmpty]: Start isEmpty. Operand 136733 states and 145317 transitions. [2025-03-08 02:11:30,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-03-08 02:11:30,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:30,609 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:11:30,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 02:11:30,609 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:30,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:30,609 INFO L85 PathProgramCache]: Analyzing trace with hash -380652595, now seen corresponding path program 1 times [2025-03-08 02:11:30,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:30,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557304700] [2025-03-08 02:11:30,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:30,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:30,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-03-08 02:11:30,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-03-08 02:11:30,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:30,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-08 02:11:30,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:30,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557304700] [2025-03-08 02:11:30,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557304700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:30,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:30,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:11:30,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402058134] [2025-03-08 02:11:30,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:30,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:11:30,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:30,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:11:30,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:30,962 INFO L87 Difference]: Start difference. First operand 136733 states and 145317 transitions. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 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-08 02:11:32,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:32,703 INFO L93 Difference]: Finished difference Result 270060 states and 286936 transitions. [2025-03-08 02:11:32,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:11:32,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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 594 [2025-03-08 02:11:32,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:32,883 INFO L225 Difference]: With dead ends: 270060 [2025-03-08 02:11:32,883 INFO L226 Difference]: Without dead ends: 133329 [2025-03-08 02:11:32,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:11:32,932 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 497 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:32,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 608 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:11:33,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133329 states. [2025-03-08 02:11:34,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133329 to 132896. [2025-03-08 02:11:34,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132896 states, 132895 states have (on average 1.0552842469618873) internal successors, (140242), 132895 states have internal predecessors, (140242), 0 states have call successors, (0), 0 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-08 02:11:34,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132896 states to 132896 states and 140242 transitions. [2025-03-08 02:11:34,774 INFO L78 Accepts]: Start accepts. Automaton has 132896 states and 140242 transitions. Word has length 594 [2025-03-08 02:11:34,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:34,775 INFO L471 AbstractCegarLoop]: Abstraction has 132896 states and 140242 transitions. [2025-03-08 02:11:34,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 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-08 02:11:34,775 INFO L276 IsEmpty]: Start isEmpty. Operand 132896 states and 140242 transitions. [2025-03-08 02:11:34,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-03-08 02:11:34,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:34,784 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:34,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 02:11:34,785 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:34,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:34,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1315065112, now seen corresponding path program 1 times [2025-03-08 02:11:34,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:34,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421327316] [2025-03-08 02:11:34,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:34,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:34,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-03-08 02:11:34,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-03-08 02:11:34,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:34,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:35,017 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-03-08 02:11:35,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:35,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421327316] [2025-03-08 02:11:35,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421327316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:35,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:35,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:11:35,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168231442] [2025-03-08 02:11:35,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:35,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:11:35,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:35,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:11:35,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:11:35,019 INFO L87 Difference]: Start difference. First operand 132896 states and 140242 transitions. Second operand has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 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-08 02:11:37,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:37,452 INFO L93 Difference]: Finished difference Result 275604 states and 290747 transitions. [2025-03-08 02:11:37,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:11:37,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 597 [2025-03-08 02:11:37,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:37,637 INFO L225 Difference]: With dead ends: 275604 [2025-03-08 02:11:37,637 INFO L226 Difference]: Without dead ends: 142710 [2025-03-08 02:11:37,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:11:37,717 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 716 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2313 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 2573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 2313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:37,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 260 Invalid, 2573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 2313 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 02:11:37,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142710 states. [2025-03-08 02:11:39,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142710 to 132040. [2025-03-08 02:11:39,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132040 states, 132039 states have (on average 1.0521512583403387) internal successors, (138925), 132039 states have internal predecessors, (138925), 0 states have call successors, (0), 0 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-08 02:11:39,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132040 states to 132040 states and 138925 transitions. [2025-03-08 02:11:39,446 INFO L78 Accepts]: Start accepts. Automaton has 132040 states and 138925 transitions. Word has length 597 [2025-03-08 02:11:39,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:39,446 INFO L471 AbstractCegarLoop]: Abstraction has 132040 states and 138925 transitions. [2025-03-08 02:11:39,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 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-08 02:11:39,446 INFO L276 IsEmpty]: Start isEmpty. Operand 132040 states and 138925 transitions. [2025-03-08 02:11:39,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2025-03-08 02:11:39,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:39,460 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:11:39,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 02:11:39,460 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:39,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:39,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1458961252, now seen corresponding path program 1 times [2025-03-08 02:11:39,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:39,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348686207] [2025-03-08 02:11:39,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:39,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:39,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 603 statements into 1 equivalence classes. [2025-03-08 02:11:39,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 603 of 603 statements. [2025-03-08 02:11:39,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:39,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:11:40,077 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2025-03-08 02:11:40,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:11:40,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348686207] [2025-03-08 02:11:40,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348686207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:11:40,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:11:40,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:11:40,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232825147] [2025-03-08 02:11:40,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:11:40,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:11:40,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:11:40,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:11:40,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:11:40,078 INFO L87 Difference]: Start difference. First operand 132040 states and 138925 transitions. Second operand has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 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-08 02:11:42,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:11:42,483 INFO L93 Difference]: Finished difference Result 270906 states and 284877 transitions. [2025-03-08 02:11:42,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:11:42,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 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 603 [2025-03-08 02:11:42,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:11:42,897 INFO L225 Difference]: With dead ends: 270906 [2025-03-08 02:11:42,897 INFO L226 Difference]: Without dead ends: 138868 [2025-03-08 02:11:42,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:11:42,944 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 733 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2723 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 2863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:11:42,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 681 Invalid, 2863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2723 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 02:11:43,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138868 states. [2025-03-08 02:11:44,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138868 to 132040. [2025-03-08 02:11:44,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132040 states, 132039 states have (on average 1.0520149349813313) internal successors, (138907), 132039 states have internal predecessors, (138907), 0 states have call successors, (0), 0 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-08 02:11:44,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132040 states to 132040 states and 138907 transitions. [2025-03-08 02:11:44,357 INFO L78 Accepts]: Start accepts. Automaton has 132040 states and 138907 transitions. Word has length 603 [2025-03-08 02:11:44,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:11:44,358 INFO L471 AbstractCegarLoop]: Abstraction has 132040 states and 138907 transitions. [2025-03-08 02:11:44,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 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-08 02:11:44,358 INFO L276 IsEmpty]: Start isEmpty. Operand 132040 states and 138907 transitions. [2025-03-08 02:11:44,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2025-03-08 02:11:44,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:11:44,370 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:11:44,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 02:11:44,370 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:11:44,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:11:44,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1048825952, now seen corresponding path program 1 times [2025-03-08 02:11:44,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:11:44,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837992602] [2025-03-08 02:11:44,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:11:44,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:11:44,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 660 statements into 1 equivalence classes. [2025-03-08 02:11:44,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 660 of 660 statements. [2025-03-08 02:11:44,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:11:44,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat