./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label19.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem18_label19.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 bf866e82ccfa9edc467f98983da1defe22311f2c1544dd5c4d747bc8c4f74632 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 11:04:50,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:04:50,349 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 11:04:50,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:04:50,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:04:50,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:04:50,374 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:04:50,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:04:50,375 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:04:50,375 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:04:50,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:04:50,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:04:50,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:04:50,376 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:04:50,376 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:04:50,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:04:50,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:04:50,376 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:04:50,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 11:04:50,376 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:04:50,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:04:50,377 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:04:50,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:04:50,377 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:04:50,377 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:04:50,377 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:04:50,378 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:04:50,378 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:04:50,378 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:04:50,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:04:50,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:04:50,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:04:50,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:04:50,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:04:50,378 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:04:50,378 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:04:50,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:04:50,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 11:04:50,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 11:04:50,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:04:50,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:04:50,378 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:04:50,378 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:04:50,378 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 -> bf866e82ccfa9edc467f98983da1defe22311f2c1544dd5c4d747bc8c4f74632 [2025-03-03 11:04:50,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:04:50,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:04:50,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:04:50,617 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:04:50,617 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:04:50,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label19.c [2025-03-03 11:04:51,696 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c5ec73b5/9d8d90fb46a54cd1996342cdca21a069/FLAG95e1a8e05 [2025-03-03 11:04:52,098 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:04:52,100 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label19.c [2025-03-03 11:04:52,117 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c5ec73b5/9d8d90fb46a54cd1996342cdca21a069/FLAG95e1a8e05 [2025-03-03 11:04:52,264 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c5ec73b5/9d8d90fb46a54cd1996342cdca21a069 [2025-03-03 11:04:52,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:04:52,267 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:04:52,268 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:04:52,268 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:04:52,271 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:04:52,272 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:04:52" (1/1) ... [2025-03-03 11:04:52,273 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d795288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:52, skipping insertion in model container [2025-03-03 11:04:52,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:04:52" (1/1) ... [2025-03-03 11:04:52,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:04:52,437 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label19.c[1342,1355] [2025-03-03 11:04:52,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:04:52,816 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:04:52,826 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label19.c[1342,1355] [2025-03-03 11:04:53,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:04:53,034 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:04:53,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:53 WrapperNode [2025-03-03 11:04:53,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:04:53,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:04:53,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:04:53,036 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:04:53,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:53" (1/1) ... [2025-03-03 11:04:53,069 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:53" (1/1) ... [2025-03-03 11:04:53,207 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2025-03-03 11:04:53,208 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:04:53,208 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:04:53,208 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:04:53,209 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:04:53,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:53" (1/1) ... [2025-03-03 11:04:53,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:53" (1/1) ... [2025-03-03 11:04:53,242 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:53" (1/1) ... [2025-03-03 11:04:53,322 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 11:04:53,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:53" (1/1) ... [2025-03-03 11:04:53,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:53" (1/1) ... [2025-03-03 11:04:53,367 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:53" (1/1) ... [2025-03-03 11:04:53,377 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:53" (1/1) ... [2025-03-03 11:04:53,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:53" (1/1) ... [2025-03-03 11:04:53,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:53" (1/1) ... [2025-03-03 11:04:53,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:04:53,419 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:04:53,419 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:04:53,419 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:04:53,420 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:53" (1/1) ... [2025-03-03 11:04:53,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:04:53,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:04:53,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 11:04:53,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 11:04:53,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:04:53,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 11:04:53,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:04:53,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:04:53,536 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:04:53,538 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:04:56,140 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647: havoc calculate_output_#t~ret8#1; [2025-03-03 11:04:56,141 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: havoc calculate_output2_#t~ret9#1; [2025-03-03 11:04:56,254 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2025-03-03 11:04:56,254 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:04:56,283 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:04:56,284 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:04:56,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:04:56 BoogieIcfgContainer [2025-03-03 11:04:56,284 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:04:56,286 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:04:56,286 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:04:56,289 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:04:56,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:04:52" (1/3) ... [2025-03-03 11:04:56,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8392fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:04:56, skipping insertion in model container [2025-03-03 11:04:56,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:53" (2/3) ... [2025-03-03 11:04:56,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c8392fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:04:56, skipping insertion in model container [2025-03-03 11:04:56,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:04:56" (3/3) ... [2025-03-03 11:04:56,291 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem18_label19.c [2025-03-03 11:04:56,301 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:04:56,304 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label19.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 11:04:56,375 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:04:56,384 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;@7e00bd9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:04:56,385 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 11:04:56,392 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:04:56,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 11:04:56,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:04:56,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:04:56,398 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:04:56,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:04:56,403 INFO L85 PathProgramCache]: Analyzing trace with hash -2022545933, now seen corresponding path program 1 times [2025-03-03 11:04:56,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:04:56,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058620424] [2025-03-03 11:04:56,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:04:56,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:04:56,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 11:04:56,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 11:04:56,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:04:56,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:04:56,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:04:56,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:04:56,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058620424] [2025-03-03 11:04:56,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058620424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:04:56,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:04:56,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:04:56,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148660774] [2025-03-03 11:04:56,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:04:56,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:04:56,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:04:56,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:04:56,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:04:56,639 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 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 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:00,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:00,443 INFO L93 Difference]: Finished difference Result 2910 states and 5656 transitions. [2025-03-03 11:05:00,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 11:05:00,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2025-03-03 11:05:00,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:00,459 INFO L225 Difference]: With dead ends: 2910 [2025-03-03 11:05:00,459 INFO L226 Difference]: Without dead ends: 2080 [2025-03-03 11:05:00,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:05:00,466 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 2216 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 3390 mSolverCounterSat, 1773 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2216 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 5163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1773 IncrementalHoareTripleChecker+Valid, 3390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:00,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2216 Valid, 168 Invalid, 5163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1773 Valid, 3390 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-03 11:05:00,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2025-03-03 11:05:00,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 2074. [2025-03-03 11:05:00,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2074 states, 2073 states have (on average 1.5561987457790643) internal successors, (3226), 2073 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:00,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 3226 transitions. [2025-03-03 11:05:00,560 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 3226 transitions. Word has length 9 [2025-03-03 11:05:00,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:00,561 INFO L471 AbstractCegarLoop]: Abstraction has 2074 states and 3226 transitions. [2025-03-03 11:05:00,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:00,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 3226 transitions. [2025-03-03 11:05:00,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 11:05:00,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:00,565 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:00,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 11:05:00,566 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:00,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:00,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1912744974, now seen corresponding path program 1 times [2025-03-03 11:05:00,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:00,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609128591] [2025-03-03 11:05:00,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:00,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:00,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 11:05:00,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 11:05:00,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:00,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:01,185 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 11:05:01,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:01,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609128591] [2025-03-03 11:05:01,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609128591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:01,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:01,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:05:01,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054658568] [2025-03-03 11:05:01,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:01,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:05:01,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:01,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:05:01,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:05:01,191 INFO L87 Difference]: Start difference. First operand 2074 states and 3226 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:04,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:04,352 INFO L93 Difference]: Finished difference Result 6906 states and 10879 transitions. [2025-03-03 11:05:04,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:05:04,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 169 [2025-03-03 11:05:04,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:04,366 INFO L225 Difference]: With dead ends: 6906 [2025-03-03 11:05:04,366 INFO L226 Difference]: Without dead ends: 4834 [2025-03-03 11:05:04,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:05:04,370 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 1923 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4331 mSolverCounterSat, 628 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1923 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 4959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 628 IncrementalHoareTripleChecker+Valid, 4331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:04,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1923 Valid, 623 Invalid, 4959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [628 Valid, 4331 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-03 11:05:04,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4834 states. [2025-03-03 11:05:04,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4834 to 4144. [2025-03-03 11:05:04,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 4143 states have (on average 1.3405744629495535) internal successors, (5554), 4143 states have internal predecessors, (5554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5554 transitions. [2025-03-03 11:05:04,452 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 5554 transitions. Word has length 169 [2025-03-03 11:05:04,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:04,453 INFO L471 AbstractCegarLoop]: Abstraction has 4144 states and 5554 transitions. [2025-03-03 11:05:04,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:04,454 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 5554 transitions. [2025-03-03 11:05:04,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-03 11:05:04,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:04,459 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:04,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 11:05:04,459 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:04,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:04,460 INFO L85 PathProgramCache]: Analyzing trace with hash -791567088, now seen corresponding path program 1 times [2025-03-03 11:05:04,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:04,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384176316] [2025-03-03 11:05:04,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:04,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:04,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-03 11:05:04,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-03 11:05:04,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:04,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:04,783 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:05:04,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:04,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384176316] [2025-03-03 11:05:04,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384176316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:04,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:04,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:05:04,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843882182] [2025-03-03 11:05:04,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:04,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:05:04,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:04,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:05:04,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:05:04,788 INFO L87 Difference]: Start difference. First operand 4144 states and 5554 transitions. Second operand has 4 states, 4 states have (on average 64.75) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:07,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:07,055 INFO L93 Difference]: Finished difference Result 10409 states and 13871 transitions. [2025-03-03 11:05:07,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:05:07,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 259 [2025-03-03 11:05:07,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:07,072 INFO L225 Difference]: With dead ends: 10409 [2025-03-03 11:05:07,074 INFO L226 Difference]: Without dead ends: 6214 [2025-03-03 11:05:07,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:05:07,081 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 513 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3037 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 3725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 3037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:07,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 637 Invalid, 3725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 3037 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 11:05:07,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6214 states. [2025-03-03 11:05:07,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6214 to 5524. [2025-03-03 11:05:07,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5524 states, 5523 states have (on average 1.196089082020641) internal successors, (6606), 5523 states have internal predecessors, (6606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:07,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 6606 transitions. [2025-03-03 11:05:07,150 INFO L78 Accepts]: Start accepts. Automaton has 5524 states and 6606 transitions. Word has length 259 [2025-03-03 11:05:07,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:07,151 INFO L471 AbstractCegarLoop]: Abstraction has 5524 states and 6606 transitions. [2025-03-03 11:05:07,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:07,151 INFO L276 IsEmpty]: Start isEmpty. Operand 5524 states and 6606 transitions. [2025-03-03 11:05:07,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 892 [2025-03-03 11:05:07,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:07,163 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:05:07,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 11:05:07,164 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:07,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:07,165 INFO L85 PathProgramCache]: Analyzing trace with hash -63700917, now seen corresponding path program 1 times [2025-03-03 11:05:07,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:07,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152639857] [2025-03-03 11:05:07,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:07,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:07,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 891 statements into 1 equivalence classes. [2025-03-03 11:05:07,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 891 of 891 statements. [2025-03-03 11:05:07,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:07,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:07,914 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2025-03-03 11:05:07,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:07,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152639857] [2025-03-03 11:05:07,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152639857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:07,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:07,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:05:07,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865254271] [2025-03-03 11:05:07,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:07,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:07,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:07,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:07,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:07,917 INFO L87 Difference]: Start difference. First operand 5524 states and 6606 transitions. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 2 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:09,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:09,483 INFO L93 Difference]: Finished difference Result 12426 states and 14971 transitions. [2025-03-03 11:05:09,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:09,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 2 states have internal predecessors, (527), 0 states have call successors, (0), 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 891 [2025-03-03 11:05:09,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:09,499 INFO L225 Difference]: With dead ends: 12426 [2025-03-03 11:05:09,499 INFO L226 Difference]: Without dead ends: 6904 [2025-03-03 11:05:09,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:09,506 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 249 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 687 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 687 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:09,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 77 Invalid, 2478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [687 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 11:05:09,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6904 states. [2025-03-03 11:05:09,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6904 to 6904. [2025-03-03 11:05:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6904 states, 6903 states have (on average 1.192814718238447) internal successors, (8234), 6903 states have internal predecessors, (8234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:09,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 8234 transitions. [2025-03-03 11:05:09,632 INFO L78 Accepts]: Start accepts. Automaton has 6904 states and 8234 transitions. Word has length 891 [2025-03-03 11:05:09,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:09,633 INFO L471 AbstractCegarLoop]: Abstraction has 6904 states and 8234 transitions. [2025-03-03 11:05:09,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 2 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:09,634 INFO L276 IsEmpty]: Start isEmpty. Operand 6904 states and 8234 transitions. [2025-03-03 11:05:09,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 914 [2025-03-03 11:05:09,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:09,654 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:05:09,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 11:05:09,655 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:09,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:09,656 INFO L85 PathProgramCache]: Analyzing trace with hash 787524194, now seen corresponding path program 1 times [2025-03-03 11:05:09,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:09,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377934062] [2025-03-03 11:05:09,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:09,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:09,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 913 statements into 1 equivalence classes. [2025-03-03 11:05:09,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 913 of 913 statements. [2025-03-03 11:05:09,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:09,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:10,468 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-03 11:05:10,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:10,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377934062] [2025-03-03 11:05:10,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377934062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:10,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:10,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:05:10,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296634970] [2025-03-03 11:05:10,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:10,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:10,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:10,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:10,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:10,472 INFO L87 Difference]: Start difference. First operand 6904 states and 8234 transitions. Second operand has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:12,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:12,013 INFO L93 Difference]: Finished difference Result 18636 states and 22610 transitions. [2025-03-03 11:05:12,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:12,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 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 913 [2025-03-03 11:05:12,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:12,040 INFO L225 Difference]: With dead ends: 18636 [2025-03-03 11:05:12,040 INFO L226 Difference]: Without dead ends: 11734 [2025-03-03 11:05:12,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:12,047 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 621 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1874 mSolverCounterSat, 619 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 2493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 619 IncrementalHoareTripleChecker+Valid, 1874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:12,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 147 Invalid, 2493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [619 Valid, 1874 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 11:05:12,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11734 states. [2025-03-03 11:05:12,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11734 to 11044. [2025-03-03 11:05:12,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11044 states, 11043 states have (on average 1.2193244589332608) internal successors, (13465), 11043 states have internal predecessors, (13465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:12,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11044 states to 11044 states and 13465 transitions. [2025-03-03 11:05:12,177 INFO L78 Accepts]: Start accepts. Automaton has 11044 states and 13465 transitions. Word has length 913 [2025-03-03 11:05:12,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:12,178 INFO L471 AbstractCegarLoop]: Abstraction has 11044 states and 13465 transitions. [2025-03-03 11:05:12,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:12,179 INFO L276 IsEmpty]: Start isEmpty. Operand 11044 states and 13465 transitions. [2025-03-03 11:05:12,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 949 [2025-03-03 11:05:12,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:12,184 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:05:12,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 11:05:12,184 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:12,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:12,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1314672815, now seen corresponding path program 1 times [2025-03-03 11:05:12,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:12,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993695975] [2025-03-03 11:05:12,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:12,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:12,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 948 statements into 1 equivalence classes. [2025-03-03 11:05:12,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 948 of 948 statements. [2025-03-03 11:05:12,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:12,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:13,575 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 229 proven. 82 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2025-03-03 11:05:13,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:13,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993695975] [2025-03-03 11:05:13,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993695975] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:05:13,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446092329] [2025-03-03 11:05:13,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:13,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:05:13,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:05:13,580 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:05:13,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 11:05:13,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 948 statements into 1 equivalence classes. [2025-03-03 11:05:13,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 948 of 948 statements. [2025-03-03 11:05:13,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:13,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:13,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 11:05:13,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:05:14,570 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2025-03-03 11:05:14,570 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:05:14,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446092329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:14,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 11:05:14,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 11:05:14,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29337093] [2025-03-03 11:05:14,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:14,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:14,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:14,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:14,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:05:14,573 INFO L87 Difference]: Start difference. First operand 11044 states and 13465 transitions. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 2 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:16,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:16,085 INFO L93 Difference]: Finished difference Result 26916 states and 33822 transitions. [2025-03-03 11:05:16,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:16,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 2 states have internal predecessors, (527), 0 states have call successors, (0), 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 948 [2025-03-03 11:05:16,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:16,112 INFO L225 Difference]: With dead ends: 26916 [2025-03-03 11:05:16,112 INFO L226 Difference]: Without dead ends: 15874 [2025-03-03 11:05:16,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 952 GetRequests, 947 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:05:16,119 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 226 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:16,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 389 Invalid, 2269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 11:05:16,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15874 states. [2025-03-03 11:05:16,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15874 to 15184. [2025-03-03 11:05:16,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15184 states, 15183 states have (on average 1.1776987420140947) internal successors, (17881), 15183 states have internal predecessors, (17881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:16,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15184 states to 15184 states and 17881 transitions. [2025-03-03 11:05:16,282 INFO L78 Accepts]: Start accepts. Automaton has 15184 states and 17881 transitions. Word has length 948 [2025-03-03 11:05:16,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:16,284 INFO L471 AbstractCegarLoop]: Abstraction has 15184 states and 17881 transitions. [2025-03-03 11:05:16,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 2 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:16,284 INFO L276 IsEmpty]: Start isEmpty. Operand 15184 states and 17881 transitions. [2025-03-03 11:05:16,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 978 [2025-03-03 11:05:16,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:16,293 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:05:16,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 11:05:16,493 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,SelfDestructingSolverStorable5 [2025-03-03 11:05:16,494 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:16,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:16,495 INFO L85 PathProgramCache]: Analyzing trace with hash -2004155000, now seen corresponding path program 1 times [2025-03-03 11:05:16,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:16,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138325422] [2025-03-03 11:05:16,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:16,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:16,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 977 statements into 1 equivalence classes. [2025-03-03 11:05:16,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 977 of 977 statements. [2025-03-03 11:05:16,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:16,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:17,563 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2025-03-03 11:05:17,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:17,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138325422] [2025-03-03 11:05:17,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138325422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:17,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:17,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:05:17,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157503435] [2025-03-03 11:05:17,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:17,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:17,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:17,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:17,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:17,565 INFO L87 Difference]: Start difference. First operand 15184 states and 17881 transitions. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:18,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:18,926 INFO L93 Difference]: Finished difference Result 30366 states and 35760 transitions. [2025-03-03 11:05:18,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:18,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 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 977 [2025-03-03 11:05:18,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:18,948 INFO L225 Difference]: With dead ends: 30366 [2025-03-03 11:05:18,949 INFO L226 Difference]: Without dead ends: 15184 [2025-03-03 11:05:18,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:18,959 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 788 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 2165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:18,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 780 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1974 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 11:05:18,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15184 states. [2025-03-03 11:05:19,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15184 to 15184. [2025-03-03 11:05:19,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15184 states, 15183 states have (on average 1.1563590858196668) internal successors, (17557), 15183 states have internal predecessors, (17557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:19,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15184 states to 15184 states and 17557 transitions. [2025-03-03 11:05:19,146 INFO L78 Accepts]: Start accepts. Automaton has 15184 states and 17557 transitions. Word has length 977 [2025-03-03 11:05:19,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:19,147 INFO L471 AbstractCegarLoop]: Abstraction has 15184 states and 17557 transitions. [2025-03-03 11:05:19,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:19,148 INFO L276 IsEmpty]: Start isEmpty. Operand 15184 states and 17557 transitions. [2025-03-03 11:05:19,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1085 [2025-03-03 11:05:19,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:19,162 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:05:19,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 11:05:19,162 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:19,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:19,164 INFO L85 PathProgramCache]: Analyzing trace with hash 233685237, now seen corresponding path program 1 times [2025-03-03 11:05:19,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:19,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64182412] [2025-03-03 11:05:19,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:19,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:19,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1084 statements into 1 equivalence classes. [2025-03-03 11:05:19,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1084 of 1084 statements. [2025-03-03 11:05:19,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:19,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:20,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 295 proven. 555 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2025-03-03 11:05:20,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:20,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64182412] [2025-03-03 11:05:20,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64182412] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:05:20,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668788888] [2025-03-03 11:05:20,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:20,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:05:20,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:05:20,232 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:05:20,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 11:05:20,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1084 statements into 1 equivalence classes. [2025-03-03 11:05:20,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1084 of 1084 statements. [2025-03-03 11:05:20,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:20,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:20,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 11:05:20,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:05:20,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-03-03 11:05:20,596 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:05:20,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668788888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:20,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 11:05:20,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 11:05:20,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888972695] [2025-03-03 11:05:20,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:20,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:20,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:20,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:20,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:05:20,599 INFO L87 Difference]: Start difference. First operand 15184 states and 17557 transitions. Second operand has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:21,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:21,940 INFO L93 Difference]: Finished difference Result 35886 states and 41314 transitions. [2025-03-03 11:05:21,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:21,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 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 1084 [2025-03-03 11:05:21,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:21,961 INFO L225 Difference]: With dead ends: 35886 [2025-03-03 11:05:21,961 INFO L226 Difference]: Without dead ends: 17254 [2025-03-03 11:05:21,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1089 GetRequests, 1084 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:05:21,976 INFO L435 NwaCegarLoop]: 967 mSDtfsCounter, 649 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1703 mSolverCounterSat, 508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 2211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 508 IncrementalHoareTripleChecker+Valid, 1703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:21,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 973 Invalid, 2211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [508 Valid, 1703 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:05:21,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17254 states. [2025-03-03 11:05:22,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17254 to 15874. [2025-03-03 11:05:22,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15874 states, 15873 states have (on average 1.0822780822780822) internal successors, (17179), 15873 states have internal predecessors, (17179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:22,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15874 states to 15874 states and 17179 transitions. [2025-03-03 11:05:22,107 INFO L78 Accepts]: Start accepts. Automaton has 15874 states and 17179 transitions. Word has length 1084 [2025-03-03 11:05:22,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:22,108 INFO L471 AbstractCegarLoop]: Abstraction has 15874 states and 17179 transitions. [2025-03-03 11:05:22,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:22,108 INFO L276 IsEmpty]: Start isEmpty. Operand 15874 states and 17179 transitions. [2025-03-03 11:05:22,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1190 [2025-03-03 11:05:22,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:22,119 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:22,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 11:05:22,319 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,SelfDestructingSolverStorable7 [2025-03-03 11:05:22,320 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:22,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:22,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1558895904, now seen corresponding path program 1 times [2025-03-03 11:05:22,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:22,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472717191] [2025-03-03 11:05:22,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:22,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:22,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1189 statements into 1 equivalence classes. [2025-03-03 11:05:22,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1189 of 1189 statements. [2025-03-03 11:05:22,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:22,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:23,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1383 backedges. 970 proven. 0 refuted. 0 times theorem prover too weak. 413 trivial. 0 not checked. [2025-03-03 11:05:23,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:23,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472717191] [2025-03-03 11:05:23,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472717191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:23,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:23,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:05:23,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000924190] [2025-03-03 11:05:23,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:23,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:23,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:23,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:23,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:23,201 INFO L87 Difference]: Start difference. First operand 15874 states and 17179 transitions. Second operand has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:24,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:24,425 INFO L93 Difference]: Finished difference Result 37956 states and 41111 transitions. [2025-03-03 11:05:24,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:24,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 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 1189 [2025-03-03 11:05:24,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:24,445 INFO L225 Difference]: With dead ends: 37956 [2025-03-03 11:05:24,445 INFO L226 Difference]: Without dead ends: 22084 [2025-03-03 11:05:24,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:24,456 INFO L435 NwaCegarLoop]: 901 mSDtfsCounter, 574 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1754 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 1754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:24,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 908 Invalid, 1936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 1754 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:05:24,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22084 states. [2025-03-03 11:05:24,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22084 to 22084. [2025-03-03 11:05:24,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22084 states, 22083 states have (on average 1.0714576823801114) internal successors, (23661), 22083 states have internal predecessors, (23661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:24,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22084 states to 22084 states and 23661 transitions. [2025-03-03 11:05:24,614 INFO L78 Accepts]: Start accepts. Automaton has 22084 states and 23661 transitions. Word has length 1189 [2025-03-03 11:05:24,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:24,614 INFO L471 AbstractCegarLoop]: Abstraction has 22084 states and 23661 transitions. [2025-03-03 11:05:24,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:24,615 INFO L276 IsEmpty]: Start isEmpty. Operand 22084 states and 23661 transitions. [2025-03-03 11:05:24,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1227 [2025-03-03 11:05:24,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:24,627 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:24,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 11:05:24,627 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:24,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:24,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1181821396, now seen corresponding path program 1 times [2025-03-03 11:05:24,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:24,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275347627] [2025-03-03 11:05:24,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:24,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:24,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1226 statements into 1 equivalence classes. [2025-03-03 11:05:24,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1226 of 1226 statements. [2025-03-03 11:05:24,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:24,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:25,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2025-03-03 11:05:25,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:25,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275347627] [2025-03-03 11:05:25,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275347627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:25,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:25,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:05:25,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719858389] [2025-03-03 11:05:25,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:25,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:05:25,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:25,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:05:25,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:05:25,480 INFO L87 Difference]: Start difference. First operand 22084 states and 23661 transitions. Second operand has 4 states, 4 states have (on average 207.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:27,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:27,342 INFO L93 Difference]: Finished difference Result 46926 states and 50391 transitions. [2025-03-03 11:05:27,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:05:27,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 207.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 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 1226 [2025-03-03 11:05:27,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:27,409 INFO L225 Difference]: With dead ends: 46926 [2025-03-03 11:05:27,409 INFO L226 Difference]: Without dead ends: 24844 [2025-03-03 11:05:27,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:05:27,415 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 964 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2753 mSolverCounterSat, 508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 3261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 508 IncrementalHoareTripleChecker+Valid, 2753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:27,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 115 Invalid, 3261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [508 Valid, 2753 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 11:05:27,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24844 states. [2025-03-03 11:05:27,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24844 to 24844. [2025-03-03 11:05:27,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24844 states, 24843 states have (on average 1.0681479692468703) internal successors, (26536), 24843 states have internal predecessors, (26536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:27,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24844 states to 24844 states and 26536 transitions. [2025-03-03 11:05:27,663 INFO L78 Accepts]: Start accepts. Automaton has 24844 states and 26536 transitions. Word has length 1226 [2025-03-03 11:05:27,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:27,664 INFO L471 AbstractCegarLoop]: Abstraction has 24844 states and 26536 transitions. [2025-03-03 11:05:27,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 207.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:27,665 INFO L276 IsEmpty]: Start isEmpty. Operand 24844 states and 26536 transitions. [2025-03-03 11:05:27,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1251 [2025-03-03 11:05:27,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:27,687 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:27,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 11:05:27,688 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:27,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:27,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1912902650, now seen corresponding path program 1 times [2025-03-03 11:05:27,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:27,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412953823] [2025-03-03 11:05:27,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:27,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:27,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1250 statements into 1 equivalence classes. [2025-03-03 11:05:27,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1250 of 1250 statements. [2025-03-03 11:05:27,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:27,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1726 backedges. 996 proven. 0 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2025-03-03 11:05:28,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:28,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412953823] [2025-03-03 11:05:28,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412953823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:28,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:28,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:05:28,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809090731] [2025-03-03 11:05:28,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:28,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:28,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:28,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:28,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:28,207 INFO L87 Difference]: Start difference. First operand 24844 states and 26536 transitions. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:29,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:29,377 INFO L93 Difference]: Finished difference Result 48996 states and 52379 transitions. [2025-03-03 11:05:29,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:29,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 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 1250 [2025-03-03 11:05:29,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:29,399 INFO L225 Difference]: With dead ends: 48996 [2025-03-03 11:05:29,399 INFO L226 Difference]: Without dead ends: 24844 [2025-03-03 11:05:29,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:29,415 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 600 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 1768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:29,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 929 Invalid, 1768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:05:29,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24844 states. [2025-03-03 11:05:29,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24844 to 24844. [2025-03-03 11:05:29,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24844 states, 24843 states have (on average 1.0606609507708409) internal successors, (26350), 24843 states have internal predecessors, (26350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:29,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24844 states to 24844 states and 26350 transitions. [2025-03-03 11:05:29,600 INFO L78 Accepts]: Start accepts. Automaton has 24844 states and 26350 transitions. Word has length 1250 [2025-03-03 11:05:29,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:29,601 INFO L471 AbstractCegarLoop]: Abstraction has 24844 states and 26350 transitions. [2025-03-03 11:05:29,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:29,601 INFO L276 IsEmpty]: Start isEmpty. Operand 24844 states and 26350 transitions. [2025-03-03 11:05:29,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1260 [2025-03-03 11:05:29,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:29,615 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:05:29,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 11:05:29,616 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:29,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:29,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1288450101, now seen corresponding path program 1 times [2025-03-03 11:05:29,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:29,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020316310] [2025-03-03 11:05:29,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:29,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:29,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1259 statements into 1 equivalence classes. [2025-03-03 11:05:29,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1259 of 1259 statements. [2025-03-03 11:05:29,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:29,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:30,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1675 backedges. 304 proven. 886 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2025-03-03 11:05:30,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:30,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020316310] [2025-03-03 11:05:30,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020316310] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:05:30,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606679462] [2025-03-03 11:05:30,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:30,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:05:30,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:05:30,466 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:05:30,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 11:05:30,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1259 statements into 1 equivalence classes. [2025-03-03 11:05:30,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1259 of 1259 statements. [2025-03-03 11:05:30,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:30,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:30,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 1473 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 11:05:30,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:05:30,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1675 backedges. 666 proven. 0 refuted. 0 times theorem prover too weak. 1009 trivial. 0 not checked. [2025-03-03 11:05:30,850 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:05:30,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606679462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:30,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 11:05:30,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 11:05:30,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382720373] [2025-03-03 11:05:30,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:30,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:30,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:30,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:30,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:05:30,852 INFO L87 Difference]: Start difference. First operand 24844 states and 26350 transitions. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:32,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:32,070 INFO L93 Difference]: Finished difference Result 48306 states and 51313 transitions. [2025-03-03 11:05:32,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:32,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 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 1259 [2025-03-03 11:05:32,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:32,092 INFO L225 Difference]: With dead ends: 48306 [2025-03-03 11:05:32,093 INFO L226 Difference]: Without dead ends: 24154 [2025-03-03 11:05:32,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1264 GetRequests, 1260 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:05:32,107 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 504 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:32,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 947 Invalid, 1891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:05:32,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24154 states. [2025-03-03 11:05:32,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24154 to 24154. [2025-03-03 11:05:32,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24154 states, 24153 states have (on average 1.0452531776590899) internal successors, (25246), 24153 states have internal predecessors, (25246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:32,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24154 states to 24154 states and 25246 transitions. [2025-03-03 11:05:32,264 INFO L78 Accepts]: Start accepts. Automaton has 24154 states and 25246 transitions. Word has length 1259 [2025-03-03 11:05:32,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:32,265 INFO L471 AbstractCegarLoop]: Abstraction has 24154 states and 25246 transitions. [2025-03-03 11:05:32,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:32,265 INFO L276 IsEmpty]: Start isEmpty. Operand 24154 states and 25246 transitions. [2025-03-03 11:05:32,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1304 [2025-03-03 11:05:32,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:32,279 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:32,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 11:05:32,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:05:32,479 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:32,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:32,480 INFO L85 PathProgramCache]: Analyzing trace with hash 747197533, now seen corresponding path program 1 times [2025-03-03 11:05:32,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:32,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274894538] [2025-03-03 11:05:32,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:32,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:32,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1303 statements into 1 equivalence classes. [2025-03-03 11:05:32,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1303 of 1303 statements. [2025-03-03 11:05:32,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:32,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:33,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1607 backedges. 557 proven. 0 refuted. 0 times theorem prover too weak. 1050 trivial. 0 not checked. [2025-03-03 11:05:33,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:33,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274894538] [2025-03-03 11:05:33,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274894538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:33,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:33,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:05:33,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11029829] [2025-03-03 11:05:33,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:33,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:33,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:33,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:33,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:33,881 INFO L87 Difference]: Start difference. First operand 24154 states and 25246 transitions. Second operand has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:35,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:35,103 INFO L93 Difference]: Finished difference Result 53826 states and 56558 transitions. [2025-03-03 11:05:35,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:35,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 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 1303 [2025-03-03 11:05:35,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:35,130 INFO L225 Difference]: With dead ends: 53826 [2025-03-03 11:05:35,130 INFO L226 Difference]: Without dead ends: 29674 [2025-03-03 11:05:35,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:35,145 INFO L435 NwaCegarLoop]: 782 mSDtfsCounter, 580 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:35,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 788 Invalid, 1989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:05:35,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29674 states. [2025-03-03 11:05:35,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29674 to 28984. [2025-03-03 11:05:35,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28984 states, 28983 states have (on average 1.0507883931960114) internal successors, (30455), 28983 states have internal predecessors, (30455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:35,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28984 states to 28984 states and 30455 transitions. [2025-03-03 11:05:35,341 INFO L78 Accepts]: Start accepts. Automaton has 28984 states and 30455 transitions. Word has length 1303 [2025-03-03 11:05:35,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:35,342 INFO L471 AbstractCegarLoop]: Abstraction has 28984 states and 30455 transitions. [2025-03-03 11:05:35,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:35,342 INFO L276 IsEmpty]: Start isEmpty. Operand 28984 states and 30455 transitions. [2025-03-03 11:05:35,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1306 [2025-03-03 11:05:35,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:35,356 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:35,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 11:05:35,357 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:35,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:35,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1195143560, now seen corresponding path program 1 times [2025-03-03 11:05:35,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:35,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869416594] [2025-03-03 11:05:35,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:35,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:35,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1305 statements into 1 equivalence classes. [2025-03-03 11:05:35,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1305 of 1305 statements. [2025-03-03 11:05:35,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:35,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:35,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2025-03-03 11:05:35,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:35,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869416594] [2025-03-03 11:05:35,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869416594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:35,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:35,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:05:35,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952743856] [2025-03-03 11:05:35,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:35,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:35,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:35,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:35,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:35,872 INFO L87 Difference]: Start difference. First operand 28984 states and 30455 transitions. Second operand has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:37,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:37,160 INFO L93 Difference]: Finished difference Result 64866 states and 68360 transitions. [2025-03-03 11:05:37,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:37,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 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 1305 [2025-03-03 11:05:37,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:37,194 INFO L225 Difference]: With dead ends: 64866 [2025-03-03 11:05:37,194 INFO L226 Difference]: Without dead ends: 35194 [2025-03-03 11:05:37,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:37,214 INFO L435 NwaCegarLoop]: 959 mSDtfsCounter, 602 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1796 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 2029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:37,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 966 Invalid, 2029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1796 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:05:37,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35194 states. [2025-03-03 11:05:37,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35194 to 33124. [2025-03-03 11:05:37,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33124 states, 33123 states have (on average 1.0487576608398999) internal successors, (34738), 33123 states have internal predecessors, (34738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:37,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33124 states to 33124 states and 34738 transitions. [2025-03-03 11:05:37,451 INFO L78 Accepts]: Start accepts. Automaton has 33124 states and 34738 transitions. Word has length 1305 [2025-03-03 11:05:37,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:37,451 INFO L471 AbstractCegarLoop]: Abstraction has 33124 states and 34738 transitions. [2025-03-03 11:05:37,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:37,451 INFO L276 IsEmpty]: Start isEmpty. Operand 33124 states and 34738 transitions. [2025-03-03 11:05:37,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1348 [2025-03-03 11:05:37,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:37,467 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:37,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 11:05:37,467 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:37,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:37,468 INFO L85 PathProgramCache]: Analyzing trace with hash -337479157, now seen corresponding path program 1 times [2025-03-03 11:05:37,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:37,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663288475] [2025-03-03 11:05:37,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:37,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:37,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1347 statements into 1 equivalence classes. [2025-03-03 11:05:37,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1347 of 1347 statements. [2025-03-03 11:05:37,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:37,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:38,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1739 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2025-03-03 11:05:38,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:38,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663288475] [2025-03-03 11:05:38,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663288475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:38,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:38,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:05:38,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727271503] [2025-03-03 11:05:38,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:38,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:38,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:38,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:38,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:38,196 INFO L87 Difference]: Start difference. First operand 33124 states and 34738 transitions. Second operand has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:38,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:38,863 INFO L93 Difference]: Finished difference Result 33821 states and 35435 transitions. [2025-03-03 11:05:38,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:38,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 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 1347 [2025-03-03 11:05:38,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:38,893 INFO L225 Difference]: With dead ends: 33821 [2025-03-03 11:05:38,893 INFO L226 Difference]: Without dead ends: 33124 [2025-03-03 11:05:38,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:38,903 INFO L435 NwaCegarLoop]: 979 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:38,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 986 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 11:05:38,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33124 states. [2025-03-03 11:05:39,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33124 to 33124. [2025-03-03 11:05:39,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33124 states, 33123 states have (on average 1.0485161368233553) internal successors, (34730), 33123 states have internal predecessors, (34730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:39,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33124 states to 33124 states and 34730 transitions. [2025-03-03 11:05:39,221 INFO L78 Accepts]: Start accepts. Automaton has 33124 states and 34730 transitions. Word has length 1347 [2025-03-03 11:05:39,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:39,221 INFO L471 AbstractCegarLoop]: Abstraction has 33124 states and 34730 transitions. [2025-03-03 11:05:39,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:39,222 INFO L276 IsEmpty]: Start isEmpty. Operand 33124 states and 34730 transitions. [2025-03-03 11:05:39,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1367 [2025-03-03 11:05:39,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:39,247 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:39,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 11:05:39,247 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:39,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:39,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1641327154, now seen corresponding path program 1 times [2025-03-03 11:05:39,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:39,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20716032] [2025-03-03 11:05:39,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:39,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:39,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1366 statements into 1 equivalence classes. [2025-03-03 11:05:39,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1366 of 1366 statements. [2025-03-03 11:05:39,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:39,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:39,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1796 backedges. 1276 proven. 0 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2025-03-03 11:05:39,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:39,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20716032] [2025-03-03 11:05:39,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20716032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:39,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:39,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:05:39,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204099139] [2025-03-03 11:05:39,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:39,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:39,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:39,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:39,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:39,922 INFO L87 Difference]: Start difference. First operand 33124 states and 34730 transitions. Second operand has 3 states, 3 states have (on average 285.3333333333333) internal successors, (856), 3 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:41,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:41,282 INFO L93 Difference]: Finished difference Result 86256 states and 90816 transitions. [2025-03-03 11:05:41,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:41,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 285.3333333333333) internal successors, (856), 3 states have internal predecessors, (856), 0 states have call successors, (0), 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 1366 [2025-03-03 11:05:41,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:41,447 INFO L225 Difference]: With dead ends: 86256 [2025-03-03 11:05:41,447 INFO L226 Difference]: Without dead ends: 53824 [2025-03-03 11:05:41,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:41,465 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 618 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1733 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 1733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:41,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 208 Invalid, 1994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 1733 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:05:41,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53824 states. [2025-03-03 11:05:41,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53824 to 53134. [2025-03-03 11:05:41,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53134 states, 53133 states have (on average 1.0457719308151243) internal successors, (55565), 53133 states have internal predecessors, (55565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53134 states to 53134 states and 55565 transitions. [2025-03-03 11:05:41,875 INFO L78 Accepts]: Start accepts. Automaton has 53134 states and 55565 transitions. Word has length 1366 [2025-03-03 11:05:41,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:41,876 INFO L471 AbstractCegarLoop]: Abstraction has 53134 states and 55565 transitions. [2025-03-03 11:05:41,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.3333333333333) internal successors, (856), 3 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:41,876 INFO L276 IsEmpty]: Start isEmpty. Operand 53134 states and 55565 transitions. [2025-03-03 11:05:41,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1525 [2025-03-03 11:05:41,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:41,895 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:41,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 11:05:41,896 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:41,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:41,896 INFO L85 PathProgramCache]: Analyzing trace with hash -76778681, now seen corresponding path program 1 times [2025-03-03 11:05:41,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:41,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448386665] [2025-03-03 11:05:41,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:41,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:41,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1524 statements into 1 equivalence classes. [2025-03-03 11:05:41,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1524 of 1524 statements. [2025-03-03 11:05:41,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:41,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:42,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2961 backedges. 1394 proven. 0 refuted. 0 times theorem prover too weak. 1567 trivial. 0 not checked. [2025-03-03 11:05:42,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:42,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448386665] [2025-03-03 11:05:42,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448386665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:42,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:42,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:05:42,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324861165] [2025-03-03 11:05:42,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:42,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:42,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:42,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:42,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:42,579 INFO L87 Difference]: Start difference. First operand 53134 states and 55565 transitions. Second operand has 3 states, 3 states have (on average 259.6666666666667) internal successors, (779), 3 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:43,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:43,922 INFO L93 Difference]: Finished difference Result 105576 states and 110437 transitions. [2025-03-03 11:05:43,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:43,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 259.6666666666667) internal successors, (779), 3 states have internal predecessors, (779), 0 states have call successors, (0), 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 1524 [2025-03-03 11:05:43,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:43,973 INFO L225 Difference]: With dead ends: 105576 [2025-03-03 11:05:43,973 INFO L226 Difference]: Without dead ends: 53134 [2025-03-03 11:05:44,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:44,006 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 600 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 1819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:44,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 236 Invalid, 1819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:05:44,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53134 states. [2025-03-03 11:05:44,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53134 to 53134. [2025-03-03 11:05:44,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53134 states, 53133 states have (on average 1.034592437844654) internal successors, (54971), 53133 states have internal predecessors, (54971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:44,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53134 states to 53134 states and 54971 transitions. [2025-03-03 11:05:44,382 INFO L78 Accepts]: Start accepts. Automaton has 53134 states and 54971 transitions. Word has length 1524 [2025-03-03 11:05:44,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:44,382 INFO L471 AbstractCegarLoop]: Abstraction has 53134 states and 54971 transitions. [2025-03-03 11:05:44,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.6666666666667) internal successors, (779), 3 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:44,383 INFO L276 IsEmpty]: Start isEmpty. Operand 53134 states and 54971 transitions. [2025-03-03 11:05:44,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1535 [2025-03-03 11:05:44,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:44,403 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:44,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 11:05:44,403 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:44,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:44,403 INFO L85 PathProgramCache]: Analyzing trace with hash 604920448, now seen corresponding path program 1 times [2025-03-03 11:05:44,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:44,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187786072] [2025-03-03 11:05:44,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:44,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:44,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1534 statements into 1 equivalence classes. [2025-03-03 11:05:44,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1534 of 1534 statements. [2025-03-03 11:05:44,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:44,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:45,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2861 backedges. 1338 proven. 0 refuted. 0 times theorem prover too weak. 1523 trivial. 0 not checked. [2025-03-03 11:05:45,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:45,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187786072] [2025-03-03 11:05:45,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187786072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:45,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:45,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:05:45,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460903091] [2025-03-03 11:05:45,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:45,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:45,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:45,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:45,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:45,057 INFO L87 Difference]: Start difference. First operand 53134 states and 54971 transitions. Second operand has 3 states, 3 states have (on average 259.6666666666667) internal successors, (779), 3 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:46,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:46,435 INFO L93 Difference]: Finished difference Result 106266 states and 109940 transitions. [2025-03-03 11:05:46,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:46,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 259.6666666666667) internal successors, (779), 3 states have internal predecessors, (779), 0 states have call successors, (0), 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 1534 [2025-03-03 11:05:46,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:46,490 INFO L225 Difference]: With dead ends: 106266 [2025-03-03 11:05:46,490 INFO L226 Difference]: Without dead ends: 53134 [2025-03-03 11:05:46,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:46,520 INFO L435 NwaCegarLoop]: 939 mSDtfsCounter, 588 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1753 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:46,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 946 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1753 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:05:46,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53134 states. [2025-03-03 11:05:46,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53134 to 53134. [2025-03-03 11:05:46,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53134 states, 53133 states have (on average 1.0284380705023244) internal successors, (54644), 53133 states have internal predecessors, (54644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:46,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53134 states to 53134 states and 54644 transitions. [2025-03-03 11:05:46,935 INFO L78 Accepts]: Start accepts. Automaton has 53134 states and 54644 transitions. Word has length 1534 [2025-03-03 11:05:46,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:46,935 INFO L471 AbstractCegarLoop]: Abstraction has 53134 states and 54644 transitions. [2025-03-03 11:05:46,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.6666666666667) internal successors, (779), 3 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:46,935 INFO L276 IsEmpty]: Start isEmpty. Operand 53134 states and 54644 transitions. [2025-03-03 11:05:46,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1669 [2025-03-03 11:05:46,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:46,961 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 11:05:46,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 11:05:46,961 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:46,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:46,962 INFO L85 PathProgramCache]: Analyzing trace with hash 292409746, now seen corresponding path program 1 times [2025-03-03 11:05:46,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:46,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640052307] [2025-03-03 11:05:46,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:46,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:47,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1668 statements into 1 equivalence classes. [2025-03-03 11:05:47,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1668 of 1668 statements. [2025-03-03 11:05:47,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:47,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:49,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2786 backedges. 1982 proven. 581 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2025-03-03 11:05:49,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:49,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640052307] [2025-03-03 11:05:49,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640052307] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:05:49,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877708712] [2025-03-03 11:05:49,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:49,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:05:49,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:05:49,728 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:05:49,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 11:05:49,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1668 statements into 1 equivalence classes. [2025-03-03 11:05:49,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1668 of 1668 statements. [2025-03-03 11:05:49,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:49,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:49,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 1883 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 11:05:50,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:05:51,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2786 backedges. 1988 proven. 0 refuted. 0 times theorem prover too weak. 798 trivial. 0 not checked. [2025-03-03 11:05:51,036 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:05:51,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877708712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:51,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 11:05:51,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2025-03-03 11:05:51,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117200163] [2025-03-03 11:05:51,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:51,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:05:51,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:51,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:05:51,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 11:05:51,041 INFO L87 Difference]: Start difference. First operand 53134 states and 54644 transitions. Second operand has 4 states, 4 states have (on average 254.75) internal successors, (1019), 3 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:53,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:53,041 INFO L93 Difference]: Finished difference Result 117306 states and 120869 transitions. [2025-03-03 11:05:53,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:05:53,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 254.75) internal successors, (1019), 3 states have internal predecessors, (1019), 0 states have call successors, (0), 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 1668 [2025-03-03 11:05:53,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:53,213 INFO L225 Difference]: With dead ends: 117306 [2025-03-03 11:05:53,213 INFO L226 Difference]: Without dead ends: 64174 [2025-03-03 11:05:53,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1675 GetRequests, 1666 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 11:05:53,225 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 791 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2663 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 3001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 2663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:53,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 65 Invalid, 3001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 2663 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 11:05:53,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64174 states. [2025-03-03 11:05:53,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64174 to 63484. [2025-03-03 11:05:53,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63484 states, 63483 states have (on average 1.0304648488571744) internal successors, (65417), 63483 states have internal predecessors, (65417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:53,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63484 states to 63484 states and 65417 transitions. [2025-03-03 11:05:53,666 INFO L78 Accepts]: Start accepts. Automaton has 63484 states and 65417 transitions. Word has length 1668 [2025-03-03 11:05:53,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:53,667 INFO L471 AbstractCegarLoop]: Abstraction has 63484 states and 65417 transitions. [2025-03-03 11:05:53,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 254.75) internal successors, (1019), 3 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:53,667 INFO L276 IsEmpty]: Start isEmpty. Operand 63484 states and 65417 transitions. [2025-03-03 11:05:53,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1707 [2025-03-03 11:05:53,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:53,693 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:53,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 11:05:53,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:05:53,894 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:53,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:53,894 INFO L85 PathProgramCache]: Analyzing trace with hash -815853391, now seen corresponding path program 1 times [2025-03-03 11:05:53,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:53,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943379677] [2025-03-03 11:05:53,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:53,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:53,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1706 statements into 1 equivalence classes. [2025-03-03 11:05:54,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1706 of 1706 statements. [2025-03-03 11:05:54,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:54,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:55,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3717 backedges. 2226 proven. 953 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2025-03-03 11:05:55,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:55,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943379677] [2025-03-03 11:05:55,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943379677] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:05:55,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366162736] [2025-03-03 11:05:55,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:55,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:05:55,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:05:55,761 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:05:55,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 11:05:55,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1706 statements into 1 equivalence classes. [2025-03-03 11:05:56,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1706 of 1706 statements. [2025-03-03 11:05:56,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:56,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:56,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 1966 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 11:05:56,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:05:56,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3717 backedges. 2184 proven. 0 refuted. 0 times theorem prover too weak. 1533 trivial. 0 not checked. [2025-03-03 11:05:56,134 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:05:56,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366162736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:56,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 11:05:56,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-03 11:05:56,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722093594] [2025-03-03 11:05:56,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:56,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:56,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:56,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:56,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 11:05:56,136 INFO L87 Difference]: Start difference. First operand 63484 states and 65417 transitions. Second operand has 3 states, 3 states have (on average 282.6666666666667) internal successors, (848), 3 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:57,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:57,521 INFO L93 Difference]: Finished difference Result 151116 states and 156008 transitions. [2025-03-03 11:05:57,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:57,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 282.6666666666667) internal successors, (848), 3 states have internal predecessors, (848), 0 states have call successors, (0), 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 1706 [2025-03-03 11:05:57,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:57,608 INFO L225 Difference]: With dead ends: 151116 [2025-03-03 11:05:57,608 INFO L226 Difference]: Without dead ends: 88324 [2025-03-03 11:05:57,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1713 GetRequests, 1706 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 11:05:57,791 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 659 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1732 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 1732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:57,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 155 Invalid, 1935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 1732 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:05:57,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88324 states. [2025-03-03 11:05:58,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88324 to 86944. [2025-03-03 11:05:58,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86944 states, 86943 states have (on average 1.0270522066181291) internal successors, (89295), 86943 states have internal predecessors, (89295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:58,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86944 states to 86944 states and 89295 transitions. [2025-03-03 11:05:58,377 INFO L78 Accepts]: Start accepts. Automaton has 86944 states and 89295 transitions. Word has length 1706 [2025-03-03 11:05:58,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:58,378 INFO L471 AbstractCegarLoop]: Abstraction has 86944 states and 89295 transitions. [2025-03-03 11:05:58,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.6666666666667) internal successors, (848), 3 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:58,378 INFO L276 IsEmpty]: Start isEmpty. Operand 86944 states and 89295 transitions. [2025-03-03 11:05:58,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1714 [2025-03-03 11:05:58,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:58,405 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:58,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 11:05:58,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:05:58,605 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:58,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:58,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1140804084, now seen corresponding path program 1 times [2025-03-03 11:05:58,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:58,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820619295] [2025-03-03 11:05:58,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:58,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:58,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1713 statements into 1 equivalence classes. [2025-03-03 11:05:58,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1713 of 1713 statements. [2025-03-03 11:05:58,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:58,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3198 backedges. 1892 proven. 0 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2025-03-03 11:05:59,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:59,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820619295] [2025-03-03 11:05:59,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820619295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:59,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:59,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:05:59,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876810610] [2025-03-03 11:05:59,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:59,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:59,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:59,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:59,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:59,439 INFO L87 Difference]: Start difference. First operand 86944 states and 89295 transitions. Second operand has 3 states, 3 states have (on average 326.6666666666667) internal successors, (980), 3 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:06:01,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:06:01,228 INFO L93 Difference]: Finished difference Result 186996 states and 192249 transitions. [2025-03-03 11:06:01,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:06:01,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 326.6666666666667) internal successors, (980), 3 states have internal predecessors, (980), 0 states have call successors, (0), 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 1713 [2025-03-03 11:06:01,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:06:01,349 INFO L225 Difference]: With dead ends: 186996 [2025-03-03 11:06:01,349 INFO L226 Difference]: Without dead ends: 100744 [2025-03-03 11:06:01,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:06:01,409 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 472 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1780 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 2005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:06:01,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 196 Invalid, 2005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1780 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 11:06:01,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100744 states. [2025-03-03 11:06:02,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100744 to 92464. [2025-03-03 11:06:02,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92464 states, 92463 states have (on average 1.0277516411970193) internal successors, (95029), 92463 states have internal predecessors, (95029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:06:02,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92464 states to 92464 states and 95029 transitions. [2025-03-03 11:06:02,311 INFO L78 Accepts]: Start accepts. Automaton has 92464 states and 95029 transitions. Word has length 1713 [2025-03-03 11:06:02,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:06:02,312 INFO L471 AbstractCegarLoop]: Abstraction has 92464 states and 95029 transitions. [2025-03-03 11:06:02,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 326.6666666666667) internal successors, (980), 3 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:06:02,312 INFO L276 IsEmpty]: Start isEmpty. Operand 92464 states and 95029 transitions. [2025-03-03 11:06:02,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1772 [2025-03-03 11:06:02,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:06:02,342 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:06:02,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 11:06:02,343 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:06:02,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:06:02,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1332562811, now seen corresponding path program 1 times [2025-03-03 11:06:02,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:06:02,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838030884] [2025-03-03 11:06:02,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:06:02,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:06:02,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1771 statements into 1 equivalence classes. [2025-03-03 11:06:02,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1771 of 1771 statements. [2025-03-03 11:06:02,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:06:02,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:06:04,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3261 backedges. 984 proven. 1702 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-03 11:06:04,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:06:04,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838030884] [2025-03-03 11:06:04,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838030884] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:06:04,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190321933] [2025-03-03 11:06:04,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:06:04,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:06:04,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:06:04,763 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:06:04,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 11:06:04,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1771 statements into 1 equivalence classes. [2025-03-03 11:06:05,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1771 of 1771 statements. [2025-03-03 11:06:05,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:06:05,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:06:05,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 1988 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 11:06:05,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:06:08,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3261 backedges. 984 proven. 1702 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-03 11:06:08,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:06:08,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3261 backedges. 2229 proven. 457 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-03 11:06:08,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190321933] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 11:06:08,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 11:06:08,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-03-03 11:06:08,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282814954] [2025-03-03 11:06:08,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 11:06:08,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 11:06:08,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:06:08,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 11:06:08,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2025-03-03 11:06:08,906 INFO L87 Difference]: Start difference. First operand 92464 states and 95029 transitions. Second operand has 16 states, 16 states have (on average 217.125) internal successors, (3474), 16 states have internal predecessors, (3474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)