./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label21.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_label21.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 094be3bd22098479b0cd50c57f93c246c7d8c744192a211aacece1f30e4af2db --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:09:04,072 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:09:04,117 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:09:04,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:09:04,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:09:04,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:09:04,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:09:04,140 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:09:04,140 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:09:04,140 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:09:04,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:09:04,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:09:04,141 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:09:04,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:09:04,141 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:09:04,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:09:04,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:09:04,141 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:09:04,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:09:04,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:09:04,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:09:04,141 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:09:04,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:09:04,142 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:09:04,142 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:09:04,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:09:04,142 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:09:04,142 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:09:04,142 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:09:04,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:09:04,142 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:09:04,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:09:04,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:09:04,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:09:04,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:09:04,142 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:09:04,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:09:04,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:09:04,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:09:04,142 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:09:04,142 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:09:04,142 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:09:04,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:09:04,143 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 -> 094be3bd22098479b0cd50c57f93c246c7d8c744192a211aacece1f30e4af2db [2025-03-08 02:09:04,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:09:04,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:09:04,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:09:04,408 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:09:04,409 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:09:04,410 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label21.c [2025-03-08 02:09:05,716 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d4fbf019/56165e42f8b74549aeaaf4836e14b597/FLAG47686a445 [2025-03-08 02:09:06,106 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:09:06,107 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label21.c [2025-03-08 02:09:06,131 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d4fbf019/56165e42f8b74549aeaaf4836e14b597/FLAG47686a445 [2025-03-08 02:09:06,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d4fbf019/56165e42f8b74549aeaaf4836e14b597 [2025-03-08 02:09:06,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:09:06,151 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:09:06,153 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:09:06,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:09:06,157 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:09:06,157 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:09:06" (1/1) ... [2025-03-08 02:09:06,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e3291da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:09:06, skipping insertion in model container [2025-03-08 02:09:06,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:09:06" (1/1) ... [2025-03-08 02:09:06,223 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:09:06,401 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_label21.c[8748,8761] [2025-03-08 02:09:06,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:09:06,743 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:09:06,768 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_label21.c[8748,8761] [2025-03-08 02:09:06,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:09:06,989 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:09:06,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:09:06 WrapperNode [2025-03-08 02:09:06,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:09:06,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:09:06,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:09:06,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:09:06,998 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:09:06" (1/1) ... [2025-03-08 02:09:07,039 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:09:06" (1/1) ... [2025-03-08 02:09:07,292 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-08 02:09:07,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:09:07,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:09:07,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:09:07,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:09:07,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:09:06" (1/1) ... [2025-03-08 02:09:07,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:09:06" (1/1) ... [2025-03-08 02:09:07,343 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:09:06" (1/1) ... [2025-03-08 02:09:07,477 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:09:07,477 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:09:06" (1/1) ... [2025-03-08 02:09:07,478 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:09:06" (1/1) ... [2025-03-08 02:09:07,558 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:09:06" (1/1) ... [2025-03-08 02:09:07,570 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:09:06" (1/1) ... [2025-03-08 02:09:07,588 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:09:06" (1/1) ... [2025-03-08 02:09:07,600 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:09:06" (1/1) ... [2025-03-08 02:09:07,628 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:09:07,629 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:09:07,630 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:09:07,630 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:09:07,631 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:09:06" (1/1) ... [2025-03-08 02:09:07,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:09:07,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:09:07,662 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:09:07,665 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:09:07,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:09:07,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:09:07,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:09:07,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:09:07,739 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:09:07,741 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:09:10,855 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-08 02:09:11,019 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-08 02:09:11,019 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:09:11,053 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:09:11,053 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:09:11,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:09:11 BoogieIcfgContainer [2025-03-08 02:09:11,053 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:09:11,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:09:11,055 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:09:11,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:09:11,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:09:06" (1/3) ... [2025-03-08 02:09:11,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27bc0613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:09:11, skipping insertion in model container [2025-03-08 02:09:11,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:09:06" (2/3) ... [2025-03-08 02:09:11,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27bc0613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:09:11, skipping insertion in model container [2025-03-08 02:09:11,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:09:11" (3/3) ... [2025-03-08 02:09:11,063 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label21.c [2025-03-08 02:09:11,077 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:09:11,078 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label21.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:09:11,133 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:09:11,142 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;@77ecaa94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:09:11,143 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:09:11,149 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:09:11,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 02:09:11,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:11,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:11,156 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:11,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:11,161 INFO L85 PathProgramCache]: Analyzing trace with hash 764874494, now seen corresponding path program 1 times [2025-03-08 02:09:11,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:11,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108143947] [2025-03-08 02:09:11,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:11,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:11,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 02:09:11,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 02:09:11,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:11,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:11,507 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:09:11,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:11,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108143947] [2025-03-08 02:09:11,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108143947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:11,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:11,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:09:11,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791426489] [2025-03-08 02:09:11,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:11,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:11,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:11,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:11,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:11,528 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 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:09:13,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:13,634 INFO L93 Difference]: Finished difference Result 1642 states and 3021 transitions. [2025-03-08 02:09:13,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:13,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-03-08 02:09:13,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:13,646 INFO L225 Difference]: With dead ends: 1642 [2025-03-08 02:09:13,646 INFO L226 Difference]: Without dead ends: 975 [2025-03-08 02:09:13,650 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:09:13,651 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 431 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:13,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 551 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 02:09:13,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-03-08 02:09:13,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 972. [2025-03-08 02:09:13,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 1.5077239958805355) internal successors, (1464), 971 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states 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:09:13,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1464 transitions. [2025-03-08 02:09:13,711 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1464 transitions. Word has length 59 [2025-03-08 02:09:13,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:13,712 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1464 transitions. [2025-03-08 02:09:13,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:09:13,712 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1464 transitions. [2025-03-08 02:09:13,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 02:09:13,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:13,715 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:13,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:09:13,715 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:13,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:13,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1976010325, now seen corresponding path program 1 times [2025-03-08 02:09:13,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:13,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711782961] [2025-03-08 02:09:13,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:13,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:13,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 02:09:13,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 02:09:13,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:13,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:14,123 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:09:14,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:14,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711782961] [2025-03-08 02:09:14,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711782961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:14,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:14,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:14,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761124266] [2025-03-08 02:09:14,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:14,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:14,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:14,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:14,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:14,127 INFO L87 Difference]: Start difference. First operand 972 states and 1464 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:15,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:15,718 INFO L93 Difference]: Finished difference Result 2814 states and 4242 transitions. [2025-03-08 02:09:15,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:15,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2025-03-08 02:09:15,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:15,724 INFO L225 Difference]: With dead ends: 2814 [2025-03-08 02:09:15,724 INFO L226 Difference]: Without dead ends: 1844 [2025-03-08 02:09:15,727 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:09:15,728 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 432 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:15,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 921 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 02:09:15,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-03-08 02:09:15,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1842. [2025-03-08 02:09:15,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1841 states have (on average 1.3601303639326452) internal successors, (2504), 1841 states have internal predecessors, (2504), 0 states have call successors, (0), 0 states 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:09:15,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2504 transitions. [2025-03-08 02:09:15,769 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2504 transitions. Word has length 129 [2025-03-08 02:09:15,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:15,771 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 2504 transitions. [2025-03-08 02:09:15,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:15,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2504 transitions. [2025-03-08 02:09:15,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 02:09:15,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:15,778 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:09:15,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:09:15,779 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:15,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:15,781 INFO L85 PathProgramCache]: Analyzing trace with hash -628330880, now seen corresponding path program 1 times [2025-03-08 02:09:15,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:15,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344120412] [2025-03-08 02:09:15,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:15,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:15,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 02:09:15,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 02:09:15,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:15,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:09:15,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:15,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344120412] [2025-03-08 02:09:15,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344120412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:15,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:15,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:09:15,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476452913] [2025-03-08 02:09:15,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:15,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:15,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:15,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:15,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:15,968 INFO L87 Difference]: Start difference. First operand 1842 states and 2504 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states 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:09:17,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:17,656 INFO L93 Difference]: Finished difference Result 5395 states and 7326 transitions. [2025-03-08 02:09:17,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:17,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 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 151 [2025-03-08 02:09:17,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:17,664 INFO L225 Difference]: With dead ends: 5395 [2025-03-08 02:09:17,664 INFO L226 Difference]: Without dead ends: 2701 [2025-03-08 02:09:17,666 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:09:17,667 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 368 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:17,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 02:09:17,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2025-03-08 02:09:17,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2701. [2025-03-08 02:09:17,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2701 states, 2700 states have (on average 1.191851851851852) internal successors, (3218), 2700 states have internal predecessors, (3218), 0 states have call successors, (0), 0 states 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:09:17,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3218 transitions. [2025-03-08 02:09:17,703 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 3218 transitions. Word has length 151 [2025-03-08 02:09:17,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:17,704 INFO L471 AbstractCegarLoop]: Abstraction has 2701 states and 3218 transitions. [2025-03-08 02:09:17,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states 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:09:17,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3218 transitions. [2025-03-08 02:09:17,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-08 02:09:17,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:17,706 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:17,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:09:17,706 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:17,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:17,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1832425049, now seen corresponding path program 1 times [2025-03-08 02:09:17,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:17,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795260128] [2025-03-08 02:09:17,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:17,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:17,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-08 02:09:17,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-08 02:09:17,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:17,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:17,893 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:09:17,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:17,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795260128] [2025-03-08 02:09:17,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795260128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:17,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:17,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:17,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075907249] [2025-03-08 02:09:17,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:17,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:17,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:17,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:17,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:17,895 INFO L87 Difference]: Start difference. First operand 2701 states and 3218 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states 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:09:19,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:19,321 INFO L93 Difference]: Finished difference Result 7108 states and 8598 transitions. [2025-03-08 02:09:19,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:19,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 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 211 [2025-03-08 02:09:19,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:19,333 INFO L225 Difference]: With dead ends: 7108 [2025-03-08 02:09:19,333 INFO L226 Difference]: Without dead ends: 4409 [2025-03-08 02:09:19,337 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:09:19,337 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:19,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 784 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:09:19,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4409 states. [2025-03-08 02:09:19,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 4409. [2025-03-08 02:09:19,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4409 states, 4408 states have (on average 1.1705989110707804) internal successors, (5160), 4408 states have internal predecessors, (5160), 0 states have call successors, (0), 0 states 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:09:19,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 5160 transitions. [2025-03-08 02:09:19,391 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 5160 transitions. Word has length 211 [2025-03-08 02:09:19,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:19,392 INFO L471 AbstractCegarLoop]: Abstraction has 4409 states and 5160 transitions. [2025-03-08 02:09:19,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states 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:09:19,392 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 5160 transitions. [2025-03-08 02:09:19,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-08 02:09:19,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:19,394 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 02:09:19,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:09:19,394 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:19,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:19,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1362212258, now seen corresponding path program 1 times [2025-03-08 02:09:19,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:19,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343728305] [2025-03-08 02:09:19,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:19,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:19,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-08 02:09:19,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-08 02:09:19,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:19,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:19,558 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 02:09:19,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:19,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343728305] [2025-03-08 02:09:19,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343728305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:19,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:19,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:19,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906704362] [2025-03-08 02:09:19,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:19,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:19,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:19,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:19,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:19,560 INFO L87 Difference]: Start difference. First operand 4409 states and 5160 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states 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:09:20,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:20,990 INFO L93 Difference]: Finished difference Result 10936 states and 12970 transitions. [2025-03-08 02:09:20,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:20,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 213 [2025-03-08 02:09:20,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:21,006 INFO L225 Difference]: With dead ends: 10936 [2025-03-08 02:09:21,006 INFO L226 Difference]: Without dead ends: 6528 [2025-03-08 02:09:21,012 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:09:21,014 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 392 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:21,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 445 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:09:21,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6528 states. [2025-03-08 02:09:21,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6528 to 4382. [2025-03-08 02:09:21,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4382 states, 4381 states have (on average 1.1684546907098836) internal successors, (5119), 4381 states have internal predecessors, (5119), 0 states have call successors, (0), 0 states 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:09:21,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4382 states to 4382 states and 5119 transitions. [2025-03-08 02:09:21,104 INFO L78 Accepts]: Start accepts. Automaton has 4382 states and 5119 transitions. Word has length 213 [2025-03-08 02:09:21,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:21,105 INFO L471 AbstractCegarLoop]: Abstraction has 4382 states and 5119 transitions. [2025-03-08 02:09:21,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states 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:09:21,105 INFO L276 IsEmpty]: Start isEmpty. Operand 4382 states and 5119 transitions. [2025-03-08 02:09:21,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-03-08 02:09:21,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:21,110 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:21,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:09:21,110 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:21,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:21,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1251873622, now seen corresponding path program 1 times [2025-03-08 02:09:21,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:21,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152319083] [2025-03-08 02:09:21,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:21,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:21,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-03-08 02:09:21,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-03-08 02:09:21,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:21,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:21,321 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 02:09:21,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:21,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152319083] [2025-03-08 02:09:21,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152319083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:21,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:21,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:21,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692991672] [2025-03-08 02:09:21,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:21,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:21,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:21,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:21,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:21,325 INFO L87 Difference]: Start difference. First operand 4382 states and 5119 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states 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:09:22,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:22,774 INFO L93 Difference]: Finished difference Result 10045 states and 11706 transitions. [2025-03-08 02:09:22,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:22,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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 279 [2025-03-08 02:09:22,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:22,788 INFO L225 Difference]: With dead ends: 10045 [2025-03-08 02:09:22,788 INFO L226 Difference]: Without dead ends: 5665 [2025-03-08 02:09:22,792 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:09:22,794 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 377 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:22,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 894 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:09:22,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5665 states. [2025-03-08 02:09:22,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5665 to 5234. [2025-03-08 02:09:22,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5234 states, 5233 states have (on average 1.1587999235620103) internal successors, (6064), 5233 states have internal predecessors, (6064), 0 states have call successors, (0), 0 states 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:09:22,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5234 states to 5234 states and 6064 transitions. [2025-03-08 02:09:22,860 INFO L78 Accepts]: Start accepts. Automaton has 5234 states and 6064 transitions. Word has length 279 [2025-03-08 02:09:22,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:22,861 INFO L471 AbstractCegarLoop]: Abstraction has 5234 states and 6064 transitions. [2025-03-08 02:09:22,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states 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:09:22,861 INFO L276 IsEmpty]: Start isEmpty. Operand 5234 states and 6064 transitions. [2025-03-08 02:09:22,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-03-08 02:09:22,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:22,864 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:22,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:09:22,864 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:22,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:22,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1619127420, now seen corresponding path program 1 times [2025-03-08 02:09:22,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:22,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404901877] [2025-03-08 02:09:22,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:22,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:22,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-08 02:09:22,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-08 02:09:22,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:22,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:23,014 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-03-08 02:09:23,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:23,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404901877] [2025-03-08 02:09:23,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404901877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:23,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:23,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:23,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647641242] [2025-03-08 02:09:23,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:23,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:23,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:23,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:23,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:23,016 INFO L87 Difference]: Start difference. First operand 5234 states and 6064 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states 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:09:24,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:24,494 INFO L93 Difference]: Finished difference Result 12593 states and 14783 transitions. [2025-03-08 02:09:24,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:24,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 291 [2025-03-08 02:09:24,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:24,508 INFO L225 Difference]: With dead ends: 12593 [2025-03-08 02:09:24,508 INFO L226 Difference]: Without dead ends: 6936 [2025-03-08 02:09:24,512 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:09:24,513 INFO L435 NwaCegarLoop]: 778 mSDtfsCounter, 383 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:24,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 847 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:09:24,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6936 states. [2025-03-08 02:09:24,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6936 to 6936. [2025-03-08 02:09:24,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6936 states, 6935 states have (on average 1.1322278298485942) internal successors, (7852), 6935 states have internal predecessors, (7852), 0 states have call successors, (0), 0 states 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:09:24,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6936 states to 6936 states and 7852 transitions. [2025-03-08 02:09:24,600 INFO L78 Accepts]: Start accepts. Automaton has 6936 states and 7852 transitions. Word has length 291 [2025-03-08 02:09:24,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:24,600 INFO L471 AbstractCegarLoop]: Abstraction has 6936 states and 7852 transitions. [2025-03-08 02:09:24,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states 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:09:24,601 INFO L276 IsEmpty]: Start isEmpty. Operand 6936 states and 7852 transitions. [2025-03-08 02:09:24,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-03-08 02:09:24,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:24,604 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:24,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 02:09:24,605 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:24,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:24,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1073108841, now seen corresponding path program 1 times [2025-03-08 02:09:24,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:24,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252465648] [2025-03-08 02:09:24,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:24,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:24,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-08 02:09:24,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-08 02:09:24,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:24,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:24,784 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-08 02:09:24,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:24,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252465648] [2025-03-08 02:09:24,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252465648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:24,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:24,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:24,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194238906] [2025-03-08 02:09:24,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:24,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:24,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:24,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:24,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:24,786 INFO L87 Difference]: Start difference. First operand 6936 states and 7852 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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:09:26,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:26,304 INFO L93 Difference]: Finished difference Result 16424 states and 18762 transitions. [2025-03-08 02:09:26,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:26,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 331 [2025-03-08 02:09:26,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:26,320 INFO L225 Difference]: With dead ends: 16424 [2025-03-08 02:09:26,320 INFO L226 Difference]: Without dead ends: 9490 [2025-03-08 02:09:26,325 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:09:26,325 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 446 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:26,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 331 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:09:26,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9490 states. [2025-03-08 02:09:26,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9490 to 8636. [2025-03-08 02:09:26,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8636 states, 8635 states have (on average 1.1345686160972785) internal successors, (9797), 8635 states have internal predecessors, (9797), 0 states have call successors, (0), 0 states 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:09:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8636 states to 8636 states and 9797 transitions. [2025-03-08 02:09:26,413 INFO L78 Accepts]: Start accepts. Automaton has 8636 states and 9797 transitions. Word has length 331 [2025-03-08 02:09:26,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:26,413 INFO L471 AbstractCegarLoop]: Abstraction has 8636 states and 9797 transitions. [2025-03-08 02:09:26,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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:09:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand 8636 states and 9797 transitions. [2025-03-08 02:09:26,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-08 02:09:26,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:26,418 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:26,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:09:26,419 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:26,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:26,419 INFO L85 PathProgramCache]: Analyzing trace with hash 718661695, now seen corresponding path program 1 times [2025-03-08 02:09:26,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:26,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213650227] [2025-03-08 02:09:26,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:26,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:26,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-08 02:09:26,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-08 02:09:26,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:26,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:26,669 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 02:09:26,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:26,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213650227] [2025-03-08 02:09:26,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213650227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:26,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:26,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:26,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119752258] [2025-03-08 02:09:26,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:26,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:26,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:26,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:26,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:26,672 INFO L87 Difference]: Start difference. First operand 8636 states and 9797 transitions. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:28,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:28,018 INFO L93 Difference]: Finished difference Result 20690 states and 23700 transitions. [2025-03-08 02:09:28,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:28,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 348 [2025-03-08 02:09:28,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:28,034 INFO L225 Difference]: With dead ends: 20690 [2025-03-08 02:09:28,035 INFO L226 Difference]: Without dead ends: 12056 [2025-03-08 02:09:28,039 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:09:28,043 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 423 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:28,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 442 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:09:28,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12056 states. [2025-03-08 02:09:28,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12056 to 11193. [2025-03-08 02:09:28,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11193 states, 11192 states have (on average 1.1317905646890636) internal successors, (12667), 11192 states have internal predecessors, (12667), 0 states have call successors, (0), 0 states 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:09:28,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11193 states to 11193 states and 12667 transitions. [2025-03-08 02:09:28,130 INFO L78 Accepts]: Start accepts. Automaton has 11193 states and 12667 transitions. Word has length 348 [2025-03-08 02:09:28,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:28,131 INFO L471 AbstractCegarLoop]: Abstraction has 11193 states and 12667 transitions. [2025-03-08 02:09:28,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:28,131 INFO L276 IsEmpty]: Start isEmpty. Operand 11193 states and 12667 transitions. [2025-03-08 02:09:28,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2025-03-08 02:09:28,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:28,139 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:28,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 02:09:28,139 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:28,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:28,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1802083578, now seen corresponding path program 1 times [2025-03-08 02:09:28,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:28,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880749845] [2025-03-08 02:09:28,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:28,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:28,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 398 statements into 1 equivalence classes. [2025-03-08 02:09:28,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 398 of 398 statements. [2025-03-08 02:09:28,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:28,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:28,519 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:09:28,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:28,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880749845] [2025-03-08 02:09:28,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880749845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:28,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:28,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:28,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224840367] [2025-03-08 02:09:28,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:28,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:09:28,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:28,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:09:28,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:09:28,526 INFO L87 Difference]: Start difference. First operand 11193 states and 12667 transitions. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states 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:09:30,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:30,295 INFO L93 Difference]: Finished difference Result 27942 states and 31647 transitions. [2025-03-08 02:09:30,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:09:30,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 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 398 [2025-03-08 02:09:30,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:30,321 INFO L225 Difference]: With dead ends: 27942 [2025-03-08 02:09:30,321 INFO L226 Difference]: Without dead ends: 16326 [2025-03-08 02:09:30,331 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:09:30,332 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 611 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 2703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:30,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 220 Invalid, 2703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 02:09:30,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16326 states. [2025-03-08 02:09:30,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16326 to 16324. [2025-03-08 02:09:30,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16324 states, 16323 states have (on average 1.1360044109538687) internal successors, (18543), 16323 states have internal predecessors, (18543), 0 states have call successors, (0), 0 states 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:09:30,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16324 states to 16324 states and 18543 transitions. [2025-03-08 02:09:30,489 INFO L78 Accepts]: Start accepts. Automaton has 16324 states and 18543 transitions. Word has length 398 [2025-03-08 02:09:30,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:30,489 INFO L471 AbstractCegarLoop]: Abstraction has 16324 states and 18543 transitions. [2025-03-08 02:09:30,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states 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:09:30,490 INFO L276 IsEmpty]: Start isEmpty. Operand 16324 states and 18543 transitions. [2025-03-08 02:09:30,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2025-03-08 02:09:30,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:30,497 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:09:30,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 02:09:30,498 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:30,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:30,498 INFO L85 PathProgramCache]: Analyzing trace with hash 264942724, now seen corresponding path program 1 times [2025-03-08 02:09:30,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:30,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293038323] [2025-03-08 02:09:30,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:30,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:30,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes. [2025-03-08 02:09:30,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-03-08 02:09:30,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:30,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:30,739 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2025-03-08 02:09:30,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:30,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293038323] [2025-03-08 02:09:30,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293038323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:30,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:30,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:30,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794290707] [2025-03-08 02:09:30,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:30,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:30,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:30,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:30,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:30,741 INFO L87 Difference]: Start difference. First operand 16324 states and 18543 transitions. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states 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:09:32,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:32,331 INFO L93 Difference]: Finished difference Result 44999 states and 51133 transitions. [2025-03-08 02:09:32,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:32,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 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 420 [2025-03-08 02:09:32,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:32,368 INFO L225 Difference]: With dead ends: 44999 [2025-03-08 02:09:32,370 INFO L226 Difference]: Without dead ends: 28677 [2025-03-08 02:09:32,382 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:09:32,382 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 495 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:32,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 269 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 02:09:32,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28677 states. [2025-03-08 02:09:32,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28677 to 26957. [2025-03-08 02:09:32,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26957 states, 26956 states have (on average 1.1296557352722956) internal successors, (30451), 26956 states have internal predecessors, (30451), 0 states have call successors, (0), 0 states 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:09:32,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26957 states to 26957 states and 30451 transitions. [2025-03-08 02:09:32,627 INFO L78 Accepts]: Start accepts. Automaton has 26957 states and 30451 transitions. Word has length 420 [2025-03-08 02:09:32,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:32,628 INFO L471 AbstractCegarLoop]: Abstraction has 26957 states and 30451 transitions. [2025-03-08 02:09:32,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states 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:09:32,628 INFO L276 IsEmpty]: Start isEmpty. Operand 26957 states and 30451 transitions. [2025-03-08 02:09:32,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-03-08 02:09:32,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:32,637 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-08 02:09:32,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 02:09:32,638 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:32,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:32,639 INFO L85 PathProgramCache]: Analyzing trace with hash 147479412, now seen corresponding path program 1 times [2025-03-08 02:09:32,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:32,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456946649] [2025-03-08 02:09:32,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:32,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:32,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-08 02:09:32,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-08 02:09:32,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:32,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:32,922 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-08 02:09:32,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:32,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456946649] [2025-03-08 02:09:32,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456946649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:32,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:32,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:32,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498653413] [2025-03-08 02:09:32,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:32,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:32,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:32,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:32,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:32,923 INFO L87 Difference]: Start difference. First operand 26957 states and 30451 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states 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:09:34,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:34,297 INFO L93 Difference]: Finished difference Result 61566 states and 69693 transitions. [2025-03-08 02:09:34,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:34,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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 441 [2025-03-08 02:09:34,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:34,335 INFO L225 Difference]: With dead ends: 61566 [2025-03-08 02:09:34,336 INFO L226 Difference]: Without dead ends: 34611 [2025-03-08 02:09:34,352 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:09:34,353 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 412 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:34,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 386 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:09:34,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34611 states. [2025-03-08 02:09:34,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34611 to 27374. [2025-03-08 02:09:34,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27374 states, 27373 states have (on average 1.1310050049318672) internal successors, (30959), 27373 states have internal predecessors, (30959), 0 states have call successors, (0), 0 states 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:09:34,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27374 states to 27374 states and 30959 transitions. [2025-03-08 02:09:34,706 INFO L78 Accepts]: Start accepts. Automaton has 27374 states and 30959 transitions. Word has length 441 [2025-03-08 02:09:34,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:34,706 INFO L471 AbstractCegarLoop]: Abstraction has 27374 states and 30959 transitions. [2025-03-08 02:09:34,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states 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:09:34,706 INFO L276 IsEmpty]: Start isEmpty. Operand 27374 states and 30959 transitions. [2025-03-08 02:09:34,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2025-03-08 02:09:34,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:34,727 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:34,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 02:09:34,728 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:34,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:34,729 INFO L85 PathProgramCache]: Analyzing trace with hash 649191311, now seen corresponding path program 1 times [2025-03-08 02:09:34,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:34,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426715322] [2025-03-08 02:09:34,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:34,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:34,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-03-08 02:09:34,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-03-08 02:09:34,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:34,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:35,317 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-08 02:09:35,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:35,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426715322] [2025-03-08 02:09:35,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426715322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:35,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:35,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:35,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281783499] [2025-03-08 02:09:35,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:35,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:35,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:35,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:35,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:35,320 INFO L87 Difference]: Start difference. First operand 27374 states and 30959 transitions. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states 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:09:36,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:36,468 INFO L93 Difference]: Finished difference Result 54736 states and 61906 transitions. [2025-03-08 02:09:36,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:36,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 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 626 [2025-03-08 02:09:36,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:36,495 INFO L225 Difference]: With dead ends: 54736 [2025-03-08 02:09:36,495 INFO L226 Difference]: Without dead ends: 27364 [2025-03-08 02:09:36,512 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:09:36,513 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 442 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:36,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 741 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:09:36,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27364 states. [2025-03-08 02:09:36,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27364 to 27362. [2025-03-08 02:09:36,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27362 states, 27361 states have (on average 1.0930156061547458) internal successors, (29906), 27361 states have internal predecessors, (29906), 0 states have call successors, (0), 0 states 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:09:36,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27362 states to 27362 states and 29906 transitions. [2025-03-08 02:09:36,781 INFO L78 Accepts]: Start accepts. Automaton has 27362 states and 29906 transitions. Word has length 626 [2025-03-08 02:09:36,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:36,782 INFO L471 AbstractCegarLoop]: Abstraction has 27362 states and 29906 transitions. [2025-03-08 02:09:36,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states 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:09:36,782 INFO L276 IsEmpty]: Start isEmpty. Operand 27362 states and 29906 transitions. [2025-03-08 02:09:36,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2025-03-08 02:09:36,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:36,797 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:36,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 02:09:36,798 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:36,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:36,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1761237573, now seen corresponding path program 1 times [2025-03-08 02:09:36,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:36,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059902215] [2025-03-08 02:09:36,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:36,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:36,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-03-08 02:09:36,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-03-08 02:09:36,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:36,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:37,219 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 454 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2025-03-08 02:09:37,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:37,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059902215] [2025-03-08 02:09:37,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059902215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:37,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:37,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:09:37,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338176835] [2025-03-08 02:09:37,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:37,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:09:37,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:37,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:09:37,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:09:37,221 INFO L87 Difference]: Start difference. First operand 27362 states and 29906 transitions. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states 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:09:39,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:39,472 INFO L93 Difference]: Finished difference Result 67944 states and 74049 transitions. [2025-03-08 02:09:39,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:09:39,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 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 626 [2025-03-08 02:09:39,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:39,512 INFO L225 Difference]: With dead ends: 67944 [2025-03-08 02:09:39,512 INFO L226 Difference]: Without dead ends: 38884 [2025-03-08 02:09:39,538 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:09:39,538 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 552 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2481 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 2802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 2481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:39,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 270 Invalid, 2802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 2481 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 02:09:39,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38884 states. [2025-03-08 02:09:39,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38884 to 37580. [2025-03-08 02:09:39,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37580 states, 37579 states have (on average 1.0904228425450384) internal successors, (40977), 37579 states have internal predecessors, (40977), 0 states have call successors, (0), 0 states 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:09:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37580 states to 37580 states and 40977 transitions. [2025-03-08 02:09:39,964 INFO L78 Accepts]: Start accepts. Automaton has 37580 states and 40977 transitions. Word has length 626 [2025-03-08 02:09:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:39,964 INFO L471 AbstractCegarLoop]: Abstraction has 37580 states and 40977 transitions. [2025-03-08 02:09:39,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states 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:09:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 37580 states and 40977 transitions. [2025-03-08 02:09:39,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-03-08 02:09:39,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:39,984 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:39,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 02:09:39,984 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:39,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:39,985 INFO L85 PathProgramCache]: Analyzing trace with hash -2101619204, now seen corresponding path program 1 times [2025-03-08 02:09:39,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:39,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411494901] [2025-03-08 02:09:39,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:39,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:40,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-03-08 02:09:40,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-03-08 02:09:40,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:40,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2025-03-08 02:09:40,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:40,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411494901] [2025-03-08 02:09:40,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411494901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:40,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:40,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:40,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833267890] [2025-03-08 02:09:40,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:40,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:40,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:40,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:40,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:40,261 INFO L87 Difference]: Start difference. First operand 37580 states and 40977 transitions. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 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:09:41,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:41,515 INFO L93 Difference]: Finished difference Result 84935 states and 92353 transitions. [2025-03-08 02:09:41,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:41,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 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 642 [2025-03-08 02:09:41,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:41,560 INFO L225 Difference]: With dead ends: 84935 [2025-03-08 02:09:41,560 INFO L226 Difference]: Without dead ends: 44796 [2025-03-08 02:09:41,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:41,585 INFO L435 NwaCegarLoop]: 782 mSDtfsCounter, 446 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:41,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 842 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:09:41,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44796 states. [2025-03-08 02:09:42,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44796 to 42242. [2025-03-08 02:09:42,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42242 states, 42241 states have (on average 1.0761819085722402) internal successors, (45459), 42241 states have internal predecessors, (45459), 0 states have call successors, (0), 0 states 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:09:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42242 states to 42242 states and 45459 transitions. [2025-03-08 02:09:42,132 INFO L78 Accepts]: Start accepts. Automaton has 42242 states and 45459 transitions. Word has length 642 [2025-03-08 02:09:42,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:42,132 INFO L471 AbstractCegarLoop]: Abstraction has 42242 states and 45459 transitions. [2025-03-08 02:09:42,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 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:09:42,133 INFO L276 IsEmpty]: Start isEmpty. Operand 42242 states and 45459 transitions. [2025-03-08 02:09:42,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2025-03-08 02:09:42,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:42,160 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:42,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 02:09:42,160 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:42,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:42,161 INFO L85 PathProgramCache]: Analyzing trace with hash -880574744, now seen corresponding path program 1 times [2025-03-08 02:09:42,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:42,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107867722] [2025-03-08 02:09:42,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:42,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:42,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 674 statements into 1 equivalence classes. [2025-03-08 02:09:42,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 674 of 674 statements. [2025-03-08 02:09:42,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:42,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 435 proven. 78 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-08 02:09:42,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:42,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107867722] [2025-03-08 02:09:42,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107867722] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:09:42,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288138737] [2025-03-08 02:09:42,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:42,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:09:42,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:09:42,689 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:09:42,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 02:09:42,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 674 statements into 1 equivalence classes. [2025-03-08 02:09:42,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 674 of 674 statements. [2025-03-08 02:09:42,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:42,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:42,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:09:42,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:09:43,126 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 435 proven. 78 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-08 02:09:43,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:09:43,395 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 513 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-08 02:09:43,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288138737] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:09:43,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:09:43,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-08 02:09:43,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032444533] [2025-03-08 02:09:43,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:43,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:09:43,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:43,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:09:43,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:09:43,397 INFO L87 Difference]: Start difference. First operand 42242 states and 45459 transitions. Second operand has 4 states, 4 states have (on average 118.25) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states 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:09:45,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:45,720 INFO L93 Difference]: Finished difference Result 111741 states and 120836 transitions. [2025-03-08 02:09:45,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:09:45,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 118.25) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 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 674 [2025-03-08 02:09:45,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:45,785 INFO L225 Difference]: With dead ends: 111741 [2025-03-08 02:09:45,785 INFO L226 Difference]: Without dead ends: 68647 [2025-03-08 02:09:45,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1349 GetRequests, 1345 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:09:45,816 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 865 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2256 mSolverCounterSat, 565 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 2821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 565 IncrementalHoareTripleChecker+Valid, 2256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:45,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 157 Invalid, 2821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [565 Valid, 2256 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 02:09:45,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68647 states. [2025-03-08 02:09:46,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68647 to 58436. [2025-03-08 02:09:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58436 states, 58435 states have (on average 1.0782578933858133) internal successors, (63008), 58435 states have internal predecessors, (63008), 0 states have call successors, (0), 0 states 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:09:46,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58436 states to 58436 states and 63008 transitions. [2025-03-08 02:09:46,515 INFO L78 Accepts]: Start accepts. Automaton has 58436 states and 63008 transitions. Word has length 674 [2025-03-08 02:09:46,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:46,515 INFO L471 AbstractCegarLoop]: Abstraction has 58436 states and 63008 transitions. [2025-03-08 02:09:46,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.25) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states 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:09:46,515 INFO L276 IsEmpty]: Start isEmpty. Operand 58436 states and 63008 transitions. [2025-03-08 02:09:46,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2025-03-08 02:09:46,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:46,530 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:46,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 02:09:46,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 02:09:46,731 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:46,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:46,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1287407448, now seen corresponding path program 1 times [2025-03-08 02:09:46,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:46,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349877136] [2025-03-08 02:09:46,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:46,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:46,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes. [2025-03-08 02:09:46,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements. [2025-03-08 02:09:46,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:46,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:46,923 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 544 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2025-03-08 02:09:46,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:46,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349877136] [2025-03-08 02:09:46,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349877136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:46,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:46,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:46,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524651369] [2025-03-08 02:09:46,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:46,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:46,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:46,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:46,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:46,925 INFO L87 Difference]: Start difference. First operand 58436 states and 63008 transitions. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states 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:09:48,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:48,383 INFO L93 Difference]: Finished difference Result 126648 states and 136676 transitions. [2025-03-08 02:09:48,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:48,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 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 677 [2025-03-08 02:09:48,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:48,447 INFO L225 Difference]: With dead ends: 126648 [2025-03-08 02:09:48,447 INFO L226 Difference]: Without dead ends: 64384 [2025-03-08 02:09:48,483 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:09:48,484 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 494 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:48,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 698 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:09:48,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64384 states. [2025-03-08 02:09:48,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64384 to 46483. [2025-03-08 02:09:48,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46483 states, 46482 states have (on average 1.067445462759778) internal successors, (49617), 46482 states have internal predecessors, (49617), 0 states have call successors, (0), 0 states 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:09:49,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46483 states to 46483 states and 49617 transitions. [2025-03-08 02:09:49,022 INFO L78 Accepts]: Start accepts. Automaton has 46483 states and 49617 transitions. Word has length 677 [2025-03-08 02:09:49,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:49,023 INFO L471 AbstractCegarLoop]: Abstraction has 46483 states and 49617 transitions. [2025-03-08 02:09:49,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states 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:09:49,023 INFO L276 IsEmpty]: Start isEmpty. Operand 46483 states and 49617 transitions. [2025-03-08 02:09:49,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 816 [2025-03-08 02:09:49,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:49,044 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:49,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 02:09:49,045 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:49,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:49,045 INFO L85 PathProgramCache]: Analyzing trace with hash 80293418, now seen corresponding path program 1 times [2025-03-08 02:09:49,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:49,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594434727] [2025-03-08 02:09:49,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:49,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:49,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 815 statements into 1 equivalence classes. [2025-03-08 02:09:49,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 815 of 815 statements. [2025-03-08 02:09:49,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:49,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:50,598 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 233 proven. 347 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-08 02:09:50,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:50,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594434727] [2025-03-08 02:09:50,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594434727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:09:50,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115750411] [2025-03-08 02:09:50,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:50,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:09:50,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:09:50,603 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:09:50,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 02:09:50,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 815 statements into 1 equivalence classes. [2025-03-08 02:09:50,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 815 of 815 statements. [2025-03-08 02:09:50,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:50,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:50,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 02:09:50,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:09:52,328 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 457 proven. 286 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 02:09:52,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:09:54,075 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 457 proven. 286 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 02:09:54,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115750411] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:09:54,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:09:54,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2025-03-08 02:09:54,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965678116] [2025-03-08 02:09:54,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:09:54,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 02:09:54,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:54,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 02:09:54,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-08 02:09:54,078 INFO L87 Difference]: Start difference. First operand 46483 states and 49617 transitions. Second operand has 10 states, 10 states have (on average 144.1) internal successors, (1441), 10 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states 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:09:57,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:57,286 INFO L93 Difference]: Finished difference Result 100351 states and 107070 transitions. [2025-03-08 02:09:57,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 02:09:57,287 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 144.1) internal successors, (1441), 10 states have internal predecessors, (1441), 0 states have call successors, (0), 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 815 [2025-03-08 02:09:57,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:57,341 INFO L225 Difference]: With dead ends: 100351 [2025-03-08 02:09:57,341 INFO L226 Difference]: Without dead ends: 53443 [2025-03-08 02:09:57,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1644 GetRequests, 1627 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2025-03-08 02:09:57,366 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 2139 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4935 mSolverCounterSat, 632 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2139 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 5567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 632 IncrementalHoareTripleChecker+Valid, 4935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:57,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2139 Valid, 196 Invalid, 5567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [632 Valid, 4935 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-08 02:09:57,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53443 states. [2025-03-08 02:09:57,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53443 to 51571. [2025-03-08 02:09:57,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51571 states, 51570 states have (on average 1.060500290866783) internal successors, (54690), 51570 states have internal predecessors, (54690), 0 states have call successors, (0), 0 states 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:09:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51571 states to 51571 states and 54690 transitions. [2025-03-08 02:09:57,923 INFO L78 Accepts]: Start accepts. Automaton has 51571 states and 54690 transitions. Word has length 815 [2025-03-08 02:09:57,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:57,924 INFO L471 AbstractCegarLoop]: Abstraction has 51571 states and 54690 transitions. [2025-03-08 02:09:57,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 144.1) internal successors, (1441), 10 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states 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:09:57,924 INFO L276 IsEmpty]: Start isEmpty. Operand 51571 states and 54690 transitions. [2025-03-08 02:09:57,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 885 [2025-03-08 02:09:57,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:57,950 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:57,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 02:09:58,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 02:09:58,151 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:58,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:58,151 INFO L85 PathProgramCache]: Analyzing trace with hash -29100929, now seen corresponding path program 1 times [2025-03-08 02:09:58,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:58,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630409132] [2025-03-08 02:09:58,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:58,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:58,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 884 statements into 1 equivalence classes. [2025-03-08 02:09:58,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 884 of 884 statements. [2025-03-08 02:09:58,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:58,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:59,058 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 730 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-08 02:09:59,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:59,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630409132] [2025-03-08 02:09:59,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630409132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:59,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:59,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:09:59,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822253858] [2025-03-08 02:09:59,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:59,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:09:59,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:59,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:09:59,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:09:59,065 INFO L87 Difference]: Start difference. First operand 51571 states and 54690 transitions. Second operand has 4 states, 4 states have (on average 174.75) internal successors, (699), 4 states have internal predecessors, (699), 0 states have call successors, (0), 0 states 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:01,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:01,362 INFO L93 Difference]: Finished difference Result 123597 states and 130942 transitions. [2025-03-08 02:10:01,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:10:01,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 174.75) internal successors, (699), 4 states have internal predecessors, (699), 0 states have call successors, (0), 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 884 [2025-03-08 02:10:01,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:01,441 INFO L225 Difference]: With dead ends: 123597 [2025-03-08 02:10:01,441 INFO L226 Difference]: Without dead ends: 70326 [2025-03-08 02:10:01,487 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:01,487 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 599 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 2426 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 2872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 2426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:01,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 164 Invalid, 2872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 2426 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 02:10:01,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70326 states. [2025-03-08 02:10:02,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70326 to 60931. [2025-03-08 02:10:02,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60931 states, 60930 states have (on average 1.0613490891186608) internal successors, (64668), 60930 states have internal predecessors, (64668), 0 states have call successors, (0), 0 states 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:02,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60931 states to 60931 states and 64668 transitions. [2025-03-08 02:10:02,122 INFO L78 Accepts]: Start accepts. Automaton has 60931 states and 64668 transitions. Word has length 884 [2025-03-08 02:10:02,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:02,123 INFO L471 AbstractCegarLoop]: Abstraction has 60931 states and 64668 transitions. [2025-03-08 02:10:02,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 174.75) internal successors, (699), 4 states have internal predecessors, (699), 0 states have call successors, (0), 0 states 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:02,123 INFO L276 IsEmpty]: Start isEmpty. Operand 60931 states and 64668 transitions. [2025-03-08 02:10:02,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 932 [2025-03-08 02:10:02,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:02,150 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 02:10:02,150 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:02,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:02,151 INFO L85 PathProgramCache]: Analyzing trace with hash -193132828, now seen corresponding path program 1 times [2025-03-08 02:10:02,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:02,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821343028] [2025-03-08 02:10:02,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:02,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:02,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 931 statements into 1 equivalence classes. [2025-03-08 02:10:02,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 931 of 931 statements. [2025-03-08 02:10:02,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:02,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:02,854 INFO L134 CoverageAnalysis]: Checked inductivity of 988 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-08 02:10:02,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:02,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821343028] [2025-03-08 02:10:02,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821343028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:02,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:02,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:02,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490037930] [2025-03-08 02:10:02,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:02,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:02,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:02,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:02,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:02,856 INFO L87 Difference]: Start difference. First operand 60931 states and 64668 transitions. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states 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:04,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:04,146 INFO L93 Difference]: Finished difference Result 127807 states and 135714 transitions. [2025-03-08 02:10:04,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:04,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 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 931 [2025-03-08 02:10:04,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:04,214 INFO L225 Difference]: With dead ends: 127807 [2025-03-08 02:10:04,214 INFO L226 Difference]: Without dead ends: 66022 [2025-03-08 02:10:04,241 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:04,242 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 498 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:04,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 620 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:10:04,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66022 states. [2025-03-08 02:10:04,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66022 to 60922. [2025-03-08 02:10:04,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60922 states, 60921 states have (on average 1.0566799625744816) internal successors, (64374), 60921 states have internal predecessors, (64374), 0 states have call successors, (0), 0 states 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:04,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60922 states to 60922 states and 64374 transitions. [2025-03-08 02:10:04,952 INFO L78 Accepts]: Start accepts. Automaton has 60922 states and 64374 transitions. Word has length 931 [2025-03-08 02:10:04,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:04,953 INFO L471 AbstractCegarLoop]: Abstraction has 60922 states and 64374 transitions. [2025-03-08 02:10:04,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states 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:04,953 INFO L276 IsEmpty]: Start isEmpty. Operand 60922 states and 64374 transitions. [2025-03-08 02:10:04,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 953 [2025-03-08 02:10:04,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:04,983 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:10:04,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 02:10:04,984 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:04,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:04,984 INFO L85 PathProgramCache]: Analyzing trace with hash -485430583, now seen corresponding path program 1 times [2025-03-08 02:10:04,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:04,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265748211] [2025-03-08 02:10:04,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:04,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:05,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 952 statements into 1 equivalence classes. [2025-03-08 02:10:05,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 952 of 952 statements. [2025-03-08 02:10:05,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:05,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:05,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1455 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 1171 trivial. 0 not checked. [2025-03-08 02:10:05,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:05,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265748211] [2025-03-08 02:10:05,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265748211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:05,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:05,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:10:05,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942958206] [2025-03-08 02:10:05,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:05,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:10:05,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:05,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:10:05,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:10:05,654 INFO L87 Difference]: Start difference. First operand 60922 states and 64374 transitions. Second operand has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 0 states 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:07,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:07,890 INFO L93 Difference]: Finished difference Result 131221 states and 138711 transitions. [2025-03-08 02:10:07,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:10:07,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 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 952 [2025-03-08 02:10:07,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:07,958 INFO L225 Difference]: With dead ends: 131221 [2025-03-08 02:10:07,959 INFO L226 Difference]: Without dead ends: 69447 [2025-03-08 02:10:08,100 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:08,100 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 901 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 2718 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 2997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 2718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:08,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 642 Invalid, 2997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 2718 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 02:10:08,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69447 states. [2025-03-08 02:10:08,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69447 to 61343. [2025-03-08 02:10:08,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61343 states, 61342 states have (on average 1.057057154967233) internal successors, (64842), 61342 states have internal predecessors, (64842), 0 states have call successors, (0), 0 states 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:08,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61343 states to 61343 states and 64842 transitions. [2025-03-08 02:10:08,807 INFO L78 Accepts]: Start accepts. Automaton has 61343 states and 64842 transitions. Word has length 952 [2025-03-08 02:10:08,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:08,808 INFO L471 AbstractCegarLoop]: Abstraction has 61343 states and 64842 transitions. [2025-03-08 02:10:08,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 0 states 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:08,808 INFO L276 IsEmpty]: Start isEmpty. Operand 61343 states and 64842 transitions. [2025-03-08 02:10:08,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1308 [2025-03-08 02:10:08,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:08,852 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:08,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 02:10:08,852 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:08,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:08,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1961868557, now seen corresponding path program 1 times [2025-03-08 02:10:08,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:08,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017095713] [2025-03-08 02:10:08,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:08,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:08,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1307 statements into 1 equivalence classes. [2025-03-08 02:10:08,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1307 of 1307 statements. [2025-03-08 02:10:08,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:08,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:10,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 1127 proven. 0 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2025-03-08 02:10:10,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:10,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017095713] [2025-03-08 02:10:10,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017095713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:10,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:10,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:10:10,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887205680] [2025-03-08 02:10:10,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:10,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:10:10,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:10,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:10:10,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:10:10,048 INFO L87 Difference]: Start difference. First operand 61343 states and 64842 transitions. Second operand has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states 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:11,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:11,985 INFO L93 Difference]: Finished difference Result 132493 states and 139969 transitions. [2025-03-08 02:10:11,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:10:11,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 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 1307 [2025-03-08 02:10:11,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:12,044 INFO L225 Difference]: With dead ends: 132493 [2025-03-08 02:10:12,044 INFO L226 Difference]: Without dead ends: 70302 [2025-03-08 02:10:12,058 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:12,059 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 531 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 2582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:12,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 204 Invalid, 2582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 02:10:12,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70302 states. [2025-03-08 02:10:12,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70302 to 58366. [2025-03-08 02:10:12,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58366 states, 58365 states have (on average 1.0580656215197464) internal successors, (61754), 58365 states have internal predecessors, (61754), 0 states have call successors, (0), 0 states 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:12,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58366 states to 58366 states and 61754 transitions. [2025-03-08 02:10:12,726 INFO L78 Accepts]: Start accepts. Automaton has 58366 states and 61754 transitions. Word has length 1307 [2025-03-08 02:10:12,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:12,727 INFO L471 AbstractCegarLoop]: Abstraction has 58366 states and 61754 transitions. [2025-03-08 02:10:12,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states 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:12,727 INFO L276 IsEmpty]: Start isEmpty. Operand 58366 states and 61754 transitions. [2025-03-08 02:10:12,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1375 [2025-03-08 02:10:12,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:12,771 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:10:12,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 02:10:12,771 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:12,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:12,772 INFO L85 PathProgramCache]: Analyzing trace with hash 129726512, now seen corresponding path program 1 times [2025-03-08 02:10:12,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:12,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450116633] [2025-03-08 02:10:12,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:12,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:12,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1374 statements into 1 equivalence classes. [2025-03-08 02:10:12,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1374 of 1374 statements. [2025-03-08 02:10:12,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:12,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:13,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2409 backedges. 1276 proven. 0 refuted. 0 times theorem prover too weak. 1133 trivial. 0 not checked. [2025-03-08 02:10:13,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:13,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450116633] [2025-03-08 02:10:13,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450116633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:13,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:13,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:10:13,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938928891] [2025-03-08 02:10:13,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:13,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:10:13,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:13,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:10:13,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:10:13,561 INFO L87 Difference]: Start difference. First operand 58366 states and 61754 transitions. Second operand has 4 states, 4 states have (on average 195.5) internal successors, (782), 4 states have internal predecessors, (782), 0 states have call successors, (0), 0 states 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:15,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:15,606 INFO L93 Difference]: Finished difference Result 135889 states and 143550 transitions. [2025-03-08 02:10:15,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:10:15,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 195.5) internal successors, (782), 4 states have internal predecessors, (782), 0 states have call successors, (0), 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 1374 [2025-03-08 02:10:15,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:15,681 INFO L225 Difference]: With dead ends: 135889 [2025-03-08 02:10:15,682 INFO L226 Difference]: Without dead ends: 77100 [2025-03-08 02:10:15,719 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:15,720 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 591 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 2250 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 2577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 2250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:15,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 197 Invalid, 2577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 2250 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 02:10:15,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77100 states. [2025-03-08 02:10:16,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77100 to 57516. [2025-03-08 02:10:16,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57516 states, 57515 states have (on average 1.058802051638703) internal successors, (60897), 57515 states have internal predecessors, (60897), 0 states have call successors, (0), 0 states 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:16,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57516 states to 57516 states and 60897 transitions. [2025-03-08 02:10:16,549 INFO L78 Accepts]: Start accepts. Automaton has 57516 states and 60897 transitions. Word has length 1374 [2025-03-08 02:10:16,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:16,550 INFO L471 AbstractCegarLoop]: Abstraction has 57516 states and 60897 transitions. [2025-03-08 02:10:16,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 195.5) internal successors, (782), 4 states have internal predecessors, (782), 0 states have call successors, (0), 0 states 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:16,550 INFO L276 IsEmpty]: Start isEmpty. Operand 57516 states and 60897 transitions. [2025-03-08 02:10:16,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1471 [2025-03-08 02:10:16,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:16,624 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 02:10:16,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 02:10:16,624 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:16,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:16,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1365934109, now seen corresponding path program 1 times [2025-03-08 02:10:16,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:16,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658584082] [2025-03-08 02:10:16,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:16,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:16,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1470 statements into 1 equivalence classes. [2025-03-08 02:10:16,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1470 of 1470 statements. [2025-03-08 02:10:16,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:16,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:18,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2703 backedges. 1054 proven. 878 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2025-03-08 02:10:18,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:18,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658584082] [2025-03-08 02:10:18,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658584082] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:10:18,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275010449] [2025-03-08 02:10:18,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:18,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:10:18,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:10:18,754 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:10:18,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 02:10:18,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1470 statements into 1 equivalence classes. [2025-03-08 02:10:19,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1470 of 1470 statements. [2025-03-08 02:10:19,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:19,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:19,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 1682 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 02:10:19,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:10:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2703 backedges. 1370 proven. 0 refuted. 0 times theorem prover too weak. 1333 trivial. 0 not checked. [2025-03-08 02:10:21,519 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:10:21,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275010449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:21,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:10:21,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2025-03-08 02:10:21,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959253850] [2025-03-08 02:10:21,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:21,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 02:10:21,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:21,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 02:10:21,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-08 02:10:21,521 INFO L87 Difference]: Start difference. First operand 57516 states and 60897 transitions. Second operand has 5 states, 5 states have (on average 156.8) internal successors, (784), 5 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)