./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n4_w8_d16_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n4_w8_d16_e0.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash fb8392d22eade0aa772f39d75e3d128ac4ff835963f7fd9a7beb55cc58dfee9e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:50:42,488 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:50:42,551 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 07:50:42,556 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:50:42,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:50:42,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:50:42,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:50:42,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:50:42,576 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:50:42,576 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:50:42,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:50:42,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:50:42,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:50:42,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:50:42,577 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:50:42,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:50:42,578 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:50:42,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:50:42,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:50:42,578 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:50:42,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:50:42,578 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:50:42,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:50:42,578 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:50:42,578 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:50:42,578 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:50:42,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:50:42,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:50:42,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:50:42,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:50:42,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:50:42,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:50:42,579 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:50:42,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:50:42,579 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:50:42,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:50:42,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:50:42,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:50:42,580 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:50:42,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:50:42,580 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fb8392d22eade0aa772f39d75e3d128ac4ff835963f7fd9a7beb55cc58dfee9e [2025-03-08 07:50:42,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:50:42,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:50:42,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:50:42,835 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:50:42,835 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:50:42,837 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n4_w8_d16_e0.c [2025-03-08 07:50:44,015 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e20bdccb3/a0ada843af134eb5afcc0189852ed8b0/FLAG45a06564d [2025-03-08 07:50:44,406 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:50:44,407 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n4_w8_d16_e0.c [2025-03-08 07:50:44,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e20bdccb3/a0ada843af134eb5afcc0189852ed8b0/FLAG45a06564d [2025-03-08 07:50:44,440 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e20bdccb3/a0ada843af134eb5afcc0189852ed8b0 [2025-03-08 07:50:44,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:50:44,443 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:50:44,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:50:44,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:50:44,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:50:44,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:50:44" (1/1) ... [2025-03-08 07:50:44,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54cf1a63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:50:44, skipping insertion in model container [2025-03-08 07:50:44,449 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:50:44" (1/1) ... [2025-03-08 07:50:44,497 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:50:44,661 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/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n4_w8_d16_e0.c[1270,1283] [2025-03-08 07:50:44,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:50:44,991 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:50:44,999 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/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n4_w8_d16_e0.c[1270,1283] [2025-03-08 07:50:45,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:50:45,223 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:50:45,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:50:45 WrapperNode [2025-03-08 07:50:45,224 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:50:45,225 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:50:45,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:50:45,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:50:45,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:50:45" (1/1) ... [2025-03-08 07:50:45,317 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:50:45" (1/1) ... [2025-03-08 07:50:45,890 INFO L138 Inliner]: procedures = 17, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 6755 [2025-03-08 07:50:45,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:50:45,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:50:45,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:50:45,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:50:45,897 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:50:45" (1/1) ... [2025-03-08 07:50:45,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:50:45" (1/1) ... [2025-03-08 07:50:46,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:50:45" (1/1) ... [2025-03-08 07:50:46,180 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 07:50:46,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:50:45" (1/1) ... [2025-03-08 07:50:46,181 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:50:45" (1/1) ... [2025-03-08 07:50:46,285 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:50:45" (1/1) ... [2025-03-08 07:50:46,303 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:50:45" (1/1) ... [2025-03-08 07:50:46,326 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:50:45" (1/1) ... [2025-03-08 07:50:46,353 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:50:45" (1/1) ... [2025-03-08 07:50:46,510 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:50:46,512 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:50:46,512 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:50:46,512 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:50:46,513 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:50:45" (1/1) ... [2025-03-08 07:50:46,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:50:46,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:50:46,539 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 07:50:46,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 07:50:46,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:50:46,559 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 07:50:46,559 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 07:50:46,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:50:46,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:50:46,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:50:46,934 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:50:46,935 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:50:52,643 INFO L? ?]: Removed 3859 outVars from TransFormulas that were not future-live. [2025-03-08 07:50:52,644 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:50:52,781 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:50:52,781 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:50:52,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:50:52 BoogieIcfgContainer [2025-03-08 07:50:52,781 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:50:52,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:50:52,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:50:52,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:50:52,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:50:44" (1/3) ... [2025-03-08 07:50:52,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1357bdb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:50:52, skipping insertion in model container [2025-03-08 07:50:52,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:50:45" (2/3) ... [2025-03-08 07:50:52,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1357bdb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:50:52, skipping insertion in model container [2025-03-08 07:50:52,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:50:52" (3/3) ... [2025-03-08 07:50:52,792 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.arbitrated_top_n4_w8_d16_e0.c [2025-03-08 07:50:52,809 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:50:52,811 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.arbitrated_top_n4_w8_d16_e0.c that has 2 procedures, 1924 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 07:50:52,895 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:50:52,903 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;@6d1ea61c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:50:52,904 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 07:50:52,914 INFO L276 IsEmpty]: Start isEmpty. Operand has 1924 states, 1908 states have (on average 1.4958071278825995) internal successors, (2854), 1909 states have internal predecessors, (2854), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:50:52,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-08 07:50:52,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:50:52,949 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:50:52,949 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:50:52,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:50:52,954 INFO L85 PathProgramCache]: Analyzing trace with hash 537960975, now seen corresponding path program 1 times [2025-03-08 07:50:52,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:50:52,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563583346] [2025-03-08 07:50:52,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:50:52,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:50:53,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-08 07:50:53,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-08 07:50:53,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:50:53,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:50:53,712 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-08 07:50:53,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:50:53,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563583346] [2025-03-08 07:50:53,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563583346] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:50:53,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341616160] [2025-03-08 07:50:53,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:50:53,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:50:53,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:50:53,716 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:50:53,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 07:50:54,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-08 07:50:54,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-08 07:50:54,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:50:54,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:50:54,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 3148 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 07:50:54,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:50:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-08 07:50:54,805 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:50:54,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341616160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:50:54,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:50:54,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 07:50:54,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093293105] [2025-03-08 07:50:54,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:50:54,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 07:50:54,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:50:54,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 07:50:54,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 07:50:54,866 INFO L87 Difference]: Start difference. First operand has 1924 states, 1908 states have (on average 1.4958071278825995) internal successors, (2854), 1909 states have internal predecessors, (2854), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 257.5) internal successors, (515), 2 states have internal predecessors, (515), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 07:50:55,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:50:55,399 INFO L93 Difference]: Finished difference Result 3503 states and 5259 transitions. [2025-03-08 07:50:55,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 07:50:55,402 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 257.5) internal successors, (515), 2 states have internal predecessors, (515), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 575 [2025-03-08 07:50:55,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:50:55,417 INFO L225 Difference]: With dead ends: 3503 [2025-03-08 07:50:55,417 INFO L226 Difference]: Without dead ends: 1921 [2025-03-08 07:50:55,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 576 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 07:50:55,424 INFO L435 NwaCegarLoop]: 2404 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2404 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:50:55,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2404 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:50:55,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2025-03-08 07:50:55,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1921. [2025-03-08 07:50:55,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1921 states, 1906 states have (on average 1.4947534102833158) internal successors, (2849), 1906 states have internal predecessors, (2849), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:50:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 2875 transitions. [2025-03-08 07:50:55,523 INFO L78 Accepts]: Start accepts. Automaton has 1921 states and 2875 transitions. Word has length 575 [2025-03-08 07:50:55,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:50:55,525 INFO L471 AbstractCegarLoop]: Abstraction has 1921 states and 2875 transitions. [2025-03-08 07:50:55,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 257.5) internal successors, (515), 2 states have internal predecessors, (515), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 07:50:55,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 2875 transitions. [2025-03-08 07:50:55,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-08 07:50:55,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:50:55,532 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:50:55,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 07:50:55,733 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,SelfDestructingSolverStorable0 [2025-03-08 07:50:55,733 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:50:55,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:50:55,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2127415202, now seen corresponding path program 1 times [2025-03-08 07:50:55,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:50:55,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158149809] [2025-03-08 07:50:55,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:50:55,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:50:55,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-08 07:50:56,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-08 07:50:56,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:50:56,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:50:58,313 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:50:58,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:50:58,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158149809] [2025-03-08 07:50:58,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158149809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:50:58,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:50:58,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:50:58,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667614611] [2025-03-08 07:50:58,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:50:58,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:50:58,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:50:58,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:50:58,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:50:58,318 INFO L87 Difference]: Start difference. First operand 1921 states and 2875 transitions. Second operand has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:50:59,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:50:59,098 INFO L93 Difference]: Finished difference Result 1925 states and 2879 transitions. [2025-03-08 07:50:59,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:50:59,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 575 [2025-03-08 07:50:59,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:50:59,108 INFO L225 Difference]: With dead ends: 1925 [2025-03-08 07:50:59,108 INFO L226 Difference]: Without dead ends: 1923 [2025-03-08 07:50:59,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:50:59,109 INFO L435 NwaCegarLoop]: 2402 mSDtfsCounter, 0 mSDsluCounter, 4799 mSDsCounter, 0 mSdLazyCounter, 1423 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7201 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:50:59,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7201 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1423 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:50:59,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2025-03-08 07:50:59,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1923. [2025-03-08 07:50:59,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1923 states, 1908 states have (on average 1.4942348008385744) internal successors, (2851), 1908 states have internal predecessors, (2851), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:50:59,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 2877 transitions. [2025-03-08 07:50:59,158 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 2877 transitions. Word has length 575 [2025-03-08 07:50:59,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:50:59,160 INFO L471 AbstractCegarLoop]: Abstraction has 1923 states and 2877 transitions. [2025-03-08 07:50:59,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:50:59,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 2877 transitions. [2025-03-08 07:50:59,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2025-03-08 07:50:59,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:50:59,170 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:50:59,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:50:59,170 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:50:59,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:50:59,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1530042542, now seen corresponding path program 1 times [2025-03-08 07:50:59,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:50:59,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67436792] [2025-03-08 07:50:59,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:50:59,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:50:59,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 576 statements into 1 equivalence classes. [2025-03-08 07:50:59,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 576 of 576 statements. [2025-03-08 07:50:59,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:50:59,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:00,677 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:00,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:00,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67436792] [2025-03-08 07:51:00,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67436792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:00,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:00,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:00,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538849616] [2025-03-08 07:51:00,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:00,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:00,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:00,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:00,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:00,681 INFO L87 Difference]: Start difference. First operand 1923 states and 2877 transitions. Second operand has 5 states, 5 states have (on average 102.8) internal successors, (514), 5 states have internal predecessors, (514), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 07:51:02,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:02,606 INFO L93 Difference]: Finished difference Result 4801 states and 7186 transitions. [2025-03-08 07:51:02,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:51:02,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 102.8) internal successors, (514), 5 states have internal predecessors, (514), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 576 [2025-03-08 07:51:02,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:02,615 INFO L225 Difference]: With dead ends: 4801 [2025-03-08 07:51:02,615 INFO L226 Difference]: Without dead ends: 1923 [2025-03-08 07:51:02,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:51:02,621 INFO L435 NwaCegarLoop]: 3686 mSDtfsCounter, 4216 mSDsluCounter, 5530 mSDsCounter, 0 mSdLazyCounter, 2845 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4224 SdHoareTripleChecker+Valid, 9216 SdHoareTripleChecker+Invalid, 2991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 2845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:02,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4224 Valid, 9216 Invalid, 2991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 2845 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 07:51:02,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2025-03-08 07:51:02,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1923. [2025-03-08 07:51:02,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1923 states, 1908 states have (on average 1.4937106918238994) internal successors, (2850), 1908 states have internal predecessors, (2850), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:02,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 2876 transitions. [2025-03-08 07:51:02,660 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 2876 transitions. Word has length 576 [2025-03-08 07:51:02,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:02,660 INFO L471 AbstractCegarLoop]: Abstraction has 1923 states and 2876 transitions. [2025-03-08 07:51:02,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.8) internal successors, (514), 5 states have internal predecessors, (514), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 07:51:02,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 2876 transitions. [2025-03-08 07:51:02,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2025-03-08 07:51:02,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:02,705 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:02,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:51:02,705 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:02,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:02,707 INFO L85 PathProgramCache]: Analyzing trace with hash -865522440, now seen corresponding path program 1 times [2025-03-08 07:51:02,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:02,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408352230] [2025-03-08 07:51:02,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:02,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:02,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-03-08 07:51:02,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-03-08 07:51:02,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:02,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:03,940 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:03,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:03,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408352230] [2025-03-08 07:51:03,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408352230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:03,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:03,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:03,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367826344] [2025-03-08 07:51:03,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:03,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:03,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:03,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:03,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:03,948 INFO L87 Difference]: Start difference. First operand 1923 states and 2876 transitions. Second operand has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 07:51:05,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:05,223 INFO L93 Difference]: Finished difference Result 3504 states and 5240 transitions. [2025-03-08 07:51:05,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:05,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 577 [2025-03-08 07:51:05,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:05,229 INFO L225 Difference]: With dead ends: 3504 [2025-03-08 07:51:05,229 INFO L226 Difference]: Without dead ends: 1923 [2025-03-08 07:51:05,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:51:05,232 INFO L435 NwaCegarLoop]: 1815 mSDtfsCounter, 2758 mSDsluCounter, 1834 mSDsCounter, 0 mSdLazyCounter, 2128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2763 SdHoareTripleChecker+Valid, 3649 SdHoareTripleChecker+Invalid, 2129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:05,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2763 Valid, 3649 Invalid, 2129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2128 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 07:51:05,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2025-03-08 07:51:05,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1923. [2025-03-08 07:51:05,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1923 states, 1908 states have (on average 1.4931865828092243) internal successors, (2849), 1908 states have internal predecessors, (2849), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:05,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 2875 transitions. [2025-03-08 07:51:05,265 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 2875 transitions. Word has length 577 [2025-03-08 07:51:05,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:05,266 INFO L471 AbstractCegarLoop]: Abstraction has 1923 states and 2875 transitions. [2025-03-08 07:51:05,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 07:51:05,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 2875 transitions. [2025-03-08 07:51:05,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2025-03-08 07:51:05,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:05,271 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:05,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:51:05,271 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:05,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:05,272 INFO L85 PathProgramCache]: Analyzing trace with hash -774508493, now seen corresponding path program 1 times [2025-03-08 07:51:05,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:05,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25745976] [2025-03-08 07:51:05,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:05,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:05,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 578 statements into 1 equivalence classes. [2025-03-08 07:51:05,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 578 of 578 statements. [2025-03-08 07:51:05,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:05,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:06,112 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:06,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:06,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25745976] [2025-03-08 07:51:06,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25745976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:06,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:06,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:06,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259279371] [2025-03-08 07:51:06,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:06,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:06,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:06,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:06,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:06,115 INFO L87 Difference]: Start difference. First operand 1923 states and 2875 transitions. Second operand has 5 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 07:51:07,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:07,213 INFO L93 Difference]: Finished difference Result 3504 states and 5238 transitions. [2025-03-08 07:51:07,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:07,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 578 [2025-03-08 07:51:07,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:07,224 INFO L225 Difference]: With dead ends: 3504 [2025-03-08 07:51:07,224 INFO L226 Difference]: Without dead ends: 1923 [2025-03-08 07:51:07,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:51:07,227 INFO L435 NwaCegarLoop]: 1815 mSDtfsCounter, 2710 mSDsluCounter, 1834 mSDsCounter, 0 mSdLazyCounter, 2126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2715 SdHoareTripleChecker+Valid, 3649 SdHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:07,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2715 Valid, 3649 Invalid, 2127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2126 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 07:51:07,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2025-03-08 07:51:07,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1923. [2025-03-08 07:51:07,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1923 states, 1908 states have (on average 1.4926624737945493) internal successors, (2848), 1908 states have internal predecessors, (2848), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 2874 transitions. [2025-03-08 07:51:07,255 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 2874 transitions. Word has length 578 [2025-03-08 07:51:07,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:07,255 INFO L471 AbstractCegarLoop]: Abstraction has 1923 states and 2874 transitions. [2025-03-08 07:51:07,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 07:51:07,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 2874 transitions. [2025-03-08 07:51:07,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-03-08 07:51:07,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:07,259 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:07,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:51:07,260 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:07,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:07,260 INFO L85 PathProgramCache]: Analyzing trace with hash -63759093, now seen corresponding path program 1 times [2025-03-08 07:51:07,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:07,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924995316] [2025-03-08 07:51:07,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:07,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:07,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-03-08 07:51:07,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-03-08 07:51:07,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:07,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:08,357 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:08,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:08,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924995316] [2025-03-08 07:51:08,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924995316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:08,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:08,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:08,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779162531] [2025-03-08 07:51:08,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:08,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:08,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:08,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:08,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:08,361 INFO L87 Difference]: Start difference. First operand 1923 states and 2874 transitions. Second operand has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 07:51:09,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:09,366 INFO L93 Difference]: Finished difference Result 3504 states and 5236 transitions. [2025-03-08 07:51:09,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:09,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 579 [2025-03-08 07:51:09,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:09,375 INFO L225 Difference]: With dead ends: 3504 [2025-03-08 07:51:09,375 INFO L226 Difference]: Without dead ends: 1923 [2025-03-08 07:51:09,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:51:09,377 INFO L435 NwaCegarLoop]: 1815 mSDtfsCounter, 5098 mSDsluCounter, 1817 mSDsCounter, 0 mSdLazyCounter, 2124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5103 SdHoareTripleChecker+Valid, 3632 SdHoareTripleChecker+Invalid, 2125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:09,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5103 Valid, 3632 Invalid, 2125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2124 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 07:51:09,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2025-03-08 07:51:09,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1923. [2025-03-08 07:51:09,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1923 states, 1908 states have (on average 1.4921383647798743) internal successors, (2847), 1908 states have internal predecessors, (2847), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:09,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 2873 transitions. [2025-03-08 07:51:09,402 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 2873 transitions. Word has length 579 [2025-03-08 07:51:09,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:09,403 INFO L471 AbstractCegarLoop]: Abstraction has 1923 states and 2873 transitions. [2025-03-08 07:51:09,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 07:51:09,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 2873 transitions. [2025-03-08 07:51:09,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2025-03-08 07:51:09,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:09,407 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:09,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:51:09,407 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:09,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:09,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1862698278, now seen corresponding path program 1 times [2025-03-08 07:51:09,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:09,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122011647] [2025-03-08 07:51:09,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:09,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:09,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 580 statements into 1 equivalence classes. [2025-03-08 07:51:09,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 580 of 580 statements. [2025-03-08 07:51:09,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:09,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:10,399 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:10,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:10,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122011647] [2025-03-08 07:51:10,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122011647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:10,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:10,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:10,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896146439] [2025-03-08 07:51:10,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:10,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:10,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:10,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:10,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:10,401 INFO L87 Difference]: Start difference. First operand 1923 states and 2873 transitions. Second operand has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 07:51:11,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:11,495 INFO L93 Difference]: Finished difference Result 3504 states and 5234 transitions. [2025-03-08 07:51:11,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:11,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 580 [2025-03-08 07:51:11,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:11,500 INFO L225 Difference]: With dead ends: 3504 [2025-03-08 07:51:11,500 INFO L226 Difference]: Without dead ends: 1923 [2025-03-08 07:51:11,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:51:11,502 INFO L435 NwaCegarLoop]: 1815 mSDtfsCounter, 5002 mSDsluCounter, 1817 mSDsCounter, 0 mSdLazyCounter, 2122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5007 SdHoareTripleChecker+Valid, 3632 SdHoareTripleChecker+Invalid, 2123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:11,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5007 Valid, 3632 Invalid, 2123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2122 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 07:51:11,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2025-03-08 07:51:11,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1923. [2025-03-08 07:51:11,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1923 states, 1908 states have (on average 1.4916142557651992) internal successors, (2846), 1908 states have internal predecessors, (2846), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:11,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 2872 transitions. [2025-03-08 07:51:11,523 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 2872 transitions. Word has length 580 [2025-03-08 07:51:11,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:11,524 INFO L471 AbstractCegarLoop]: Abstraction has 1923 states and 2872 transitions. [2025-03-08 07:51:11,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 07:51:11,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 2872 transitions. [2025-03-08 07:51:11,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2025-03-08 07:51:11,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:11,527 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:11,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:51:11,528 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:11,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:11,528 INFO L85 PathProgramCache]: Analyzing trace with hash 11320222, now seen corresponding path program 1 times [2025-03-08 07:51:11,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:11,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507252677] [2025-03-08 07:51:11,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:11,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:11,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 581 statements into 1 equivalence classes. [2025-03-08 07:51:11,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 581 of 581 statements. [2025-03-08 07:51:11,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:11,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:12,279 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:12,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:12,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507252677] [2025-03-08 07:51:12,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507252677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:12,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:12,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:51:12,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466438716] [2025-03-08 07:51:12,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:12,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:51:12,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:12,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:51:12,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:51:12,281 INFO L87 Difference]: Start difference. First operand 1923 states and 2872 transitions. Second operand has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:12,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:12,831 INFO L93 Difference]: Finished difference Result 3506 states and 5235 transitions. [2025-03-08 07:51:12,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:12,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 581 [2025-03-08 07:51:12,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:12,840 INFO L225 Difference]: With dead ends: 3506 [2025-03-08 07:51:12,842 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:51:12,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:51:12,844 INFO L435 NwaCegarLoop]: 2397 mSDtfsCounter, 0 mSDsluCounter, 4786 mSDsCounter, 0 mSdLazyCounter, 1426 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7183 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:12,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7183 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1426 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:51:12,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:51:12,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:51:12,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1910 states have (on average 1.4910994764397907) internal successors, (2848), 1910 states have internal predecessors, (2848), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:12,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2874 transitions. [2025-03-08 07:51:12,867 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2874 transitions. Word has length 581 [2025-03-08 07:51:12,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:12,867 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2874 transitions. [2025-03-08 07:51:12,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:12,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2874 transitions. [2025-03-08 07:51:12,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2025-03-08 07:51:12,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:12,875 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:12,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:51:12,875 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:12,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:12,876 INFO L85 PathProgramCache]: Analyzing trace with hash -2012529619, now seen corresponding path program 1 times [2025-03-08 07:51:12,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:12,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108470726] [2025-03-08 07:51:12,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:12,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:13,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 582 statements into 1 equivalence classes. [2025-03-08 07:51:13,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 582 of 582 statements. [2025-03-08 07:51:13,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:13,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:14,123 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:14,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:14,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108470726] [2025-03-08 07:51:14,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108470726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:14,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:14,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:51:14,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013055006] [2025-03-08 07:51:14,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:14,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:51:14,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:14,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:51:14,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:51:14,126 INFO L87 Difference]: Start difference. First operand 1925 states and 2874 transitions. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:14,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:14,726 INFO L93 Difference]: Finished difference Result 3508 states and 5236 transitions. [2025-03-08 07:51:14,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:14,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 582 [2025-03-08 07:51:14,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:14,731 INFO L225 Difference]: With dead ends: 3508 [2025-03-08 07:51:14,731 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:51:14,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-08 07:51:14,735 INFO L435 NwaCegarLoop]: 2306 mSDtfsCounter, 2385 mSDsluCounter, 2308 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2385 SdHoareTripleChecker+Valid, 4614 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:14,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2385 Valid, 4614 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:51:14,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:51:14,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:51:14,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1910 states have (on average 1.4900523560209424) internal successors, (2846), 1910 states have internal predecessors, (2846), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:14,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2872 transitions. [2025-03-08 07:51:14,767 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2872 transitions. Word has length 582 [2025-03-08 07:51:14,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:14,767 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2872 transitions. [2025-03-08 07:51:14,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:14,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2872 transitions. [2025-03-08 07:51:14,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2025-03-08 07:51:14,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:14,772 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:14,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:51:14,772 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:14,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:14,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1912631567, now seen corresponding path program 1 times [2025-03-08 07:51:14,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:14,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092695575] [2025-03-08 07:51:14,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:14,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:14,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-03-08 07:51:15,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-03-08 07:51:15,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:15,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:15,879 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:15,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:15,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092695575] [2025-03-08 07:51:15,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092695575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:15,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:15,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:15,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735727336] [2025-03-08 07:51:15,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:15,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:15,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:15,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:15,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:15,881 INFO L87 Difference]: Start difference. First operand 1925 states and 2872 transitions. Second operand has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:16,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:16,628 INFO L93 Difference]: Finished difference Result 3766 states and 5615 transitions. [2025-03-08 07:51:16,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:51:16,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 584 [2025-03-08 07:51:16,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:16,635 INFO L225 Difference]: With dead ends: 3766 [2025-03-08 07:51:16,635 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:51:16,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:51:16,637 INFO L435 NwaCegarLoop]: 2376 mSDtfsCounter, 3134 mSDsluCounter, 4696 mSDsCounter, 0 mSdLazyCounter, 1545 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3134 SdHoareTripleChecker+Valid, 7072 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:16,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3134 Valid, 7072 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1545 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:51:16,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:51:16,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:51:16,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1910 states have (on average 1.4895287958115184) internal successors, (2845), 1910 states have internal predecessors, (2845), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:16,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2871 transitions. [2025-03-08 07:51:16,661 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2871 transitions. Word has length 584 [2025-03-08 07:51:16,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:16,661 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2871 transitions. [2025-03-08 07:51:16,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:16,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2871 transitions. [2025-03-08 07:51:16,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2025-03-08 07:51:16,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:16,665 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:16,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:51:16,666 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:16,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:16,666 INFO L85 PathProgramCache]: Analyzing trace with hash -2079269989, now seen corresponding path program 1 times [2025-03-08 07:51:16,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:16,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120222358] [2025-03-08 07:51:16,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:16,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:16,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 585 statements into 1 equivalence classes. [2025-03-08 07:51:16,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 585 of 585 statements. [2025-03-08 07:51:16,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:16,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:17,608 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:17,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:17,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120222358] [2025-03-08 07:51:17,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120222358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:17,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:17,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:17,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886326954] [2025-03-08 07:51:17,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:17,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:17,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:17,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:17,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:17,612 INFO L87 Difference]: Start difference. First operand 1925 states and 2871 transitions. Second operand has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:18,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:18,204 INFO L93 Difference]: Finished difference Result 3508 states and 5230 transitions. [2025-03-08 07:51:18,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:18,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 585 [2025-03-08 07:51:18,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:18,211 INFO L225 Difference]: With dead ends: 3508 [2025-03-08 07:51:18,211 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:51:18,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:51:18,214 INFO L435 NwaCegarLoop]: 2306 mSDtfsCounter, 2835 mSDsluCounter, 2325 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2848 SdHoareTripleChecker+Valid, 4631 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:18,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2848 Valid, 4631 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:51:18,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:51:18,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:51:18,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1910 states have (on average 1.4890052356020942) internal successors, (2844), 1910 states have internal predecessors, (2844), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:18,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2870 transitions. [2025-03-08 07:51:18,245 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2870 transitions. Word has length 585 [2025-03-08 07:51:18,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:18,246 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2870 transitions. [2025-03-08 07:51:18,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:18,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2870 transitions. [2025-03-08 07:51:18,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2025-03-08 07:51:18,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:18,252 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:18,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:51:18,254 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:18,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:18,254 INFO L85 PathProgramCache]: Analyzing trace with hash -53048906, now seen corresponding path program 1 times [2025-03-08 07:51:18,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:18,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166359098] [2025-03-08 07:51:18,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:18,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:18,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 586 statements into 1 equivalence classes. [2025-03-08 07:51:18,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 586 of 586 statements. [2025-03-08 07:51:18,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:18,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:19,011 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:19,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:19,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166359098] [2025-03-08 07:51:19,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166359098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:19,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:19,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:19,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124962638] [2025-03-08 07:51:19,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:19,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:19,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:19,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:19,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:19,013 INFO L87 Difference]: Start difference. First operand 1925 states and 2870 transitions. Second operand has 5 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:19,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:19,575 INFO L93 Difference]: Finished difference Result 3508 states and 5228 transitions. [2025-03-08 07:51:19,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:19,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 586 [2025-03-08 07:51:19,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:19,580 INFO L225 Difference]: With dead ends: 3508 [2025-03-08 07:51:19,580 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:51:19,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:51:19,582 INFO L435 NwaCegarLoop]: 2306 mSDtfsCounter, 5260 mSDsluCounter, 2308 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5273 SdHoareTripleChecker+Valid, 4614 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:19,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5273 Valid, 4614 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:51:19,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:51:19,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:51:19,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1910 states have (on average 1.4884816753926702) internal successors, (2843), 1910 states have internal predecessors, (2843), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:19,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2869 transitions. [2025-03-08 07:51:19,600 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2869 transitions. Word has length 586 [2025-03-08 07:51:19,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:19,600 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2869 transitions. [2025-03-08 07:51:19,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2869 transitions. [2025-03-08 07:51:19,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2025-03-08 07:51:19,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:19,603 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:19,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:51:19,603 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:19,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:19,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1854846465, now seen corresponding path program 1 times [2025-03-08 07:51:19,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:19,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600889161] [2025-03-08 07:51:19,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:19,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:19,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 587 statements into 1 equivalence classes. [2025-03-08 07:51:19,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 587 of 587 statements. [2025-03-08 07:51:19,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:19,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:20,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:20,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600889161] [2025-03-08 07:51:20,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600889161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:20,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:20,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:20,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887860551] [2025-03-08 07:51:20,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:20,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:20,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:20,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:20,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:20,291 INFO L87 Difference]: Start difference. First operand 1925 states and 2869 transitions. Second operand has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:20,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:20,870 INFO L93 Difference]: Finished difference Result 3508 states and 5226 transitions. [2025-03-08 07:51:20,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:20,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 587 [2025-03-08 07:51:20,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:20,876 INFO L225 Difference]: With dead ends: 3508 [2025-03-08 07:51:20,876 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:51:20,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:51:20,878 INFO L435 NwaCegarLoop]: 2306 mSDtfsCounter, 2784 mSDsluCounter, 2325 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2797 SdHoareTripleChecker+Valid, 4631 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:20,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2797 Valid, 4631 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:51:20,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:51:20,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:51:20,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1910 states have (on average 1.4879581151832462) internal successors, (2842), 1910 states have internal predecessors, (2842), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:20,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2868 transitions. [2025-03-08 07:51:20,895 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2868 transitions. Word has length 587 [2025-03-08 07:51:20,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:20,896 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2868 transitions. [2025-03-08 07:51:20,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:20,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2868 transitions. [2025-03-08 07:51:20,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2025-03-08 07:51:20,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:20,899 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:20,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:51:20,899 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:20,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:20,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1155047409, now seen corresponding path program 1 times [2025-03-08 07:51:20,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:20,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933478560] [2025-03-08 07:51:20,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:20,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:20,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 588 statements into 1 equivalence classes. [2025-03-08 07:51:21,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 588 of 588 statements. [2025-03-08 07:51:21,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:21,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:21,591 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:21,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:21,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933478560] [2025-03-08 07:51:21,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933478560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:21,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:21,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:21,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895885985] [2025-03-08 07:51:21,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:21,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:21,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:21,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:21,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:21,594 INFO L87 Difference]: Start difference. First operand 1925 states and 2868 transitions. Second operand has 5 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:22,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:22,148 INFO L93 Difference]: Finished difference Result 3508 states and 5224 transitions. [2025-03-08 07:51:22,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:22,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 588 [2025-03-08 07:51:22,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:22,152 INFO L225 Difference]: With dead ends: 3508 [2025-03-08 07:51:22,152 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:51:22,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:51:22,154 INFO L435 NwaCegarLoop]: 2306 mSDtfsCounter, 5158 mSDsluCounter, 2308 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5171 SdHoareTripleChecker+Valid, 4614 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:22,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5171 Valid, 4614 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:51:22,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:51:22,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:51:22,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1910 states have (on average 1.487434554973822) internal successors, (2841), 1910 states have internal predecessors, (2841), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:22,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2867 transitions. [2025-03-08 07:51:22,170 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2867 transitions. Word has length 588 [2025-03-08 07:51:22,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:22,171 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2867 transitions. [2025-03-08 07:51:22,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:22,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2867 transitions. [2025-03-08 07:51:22,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-03-08 07:51:22,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:22,174 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:22,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 07:51:22,174 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:22,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:22,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1844323771, now seen corresponding path program 1 times [2025-03-08 07:51:22,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:22,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317475505] [2025-03-08 07:51:22,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:22,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:22,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-03-08 07:51:22,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-03-08 07:51:22,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:22,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:22,862 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:22,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:22,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317475505] [2025-03-08 07:51:22,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317475505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:22,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:22,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:22,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316451038] [2025-03-08 07:51:22,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:22,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:22,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:22,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:22,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:22,864 INFO L87 Difference]: Start difference. First operand 1925 states and 2867 transitions. Second operand has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:23,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:23,418 INFO L93 Difference]: Finished difference Result 3508 states and 5222 transitions. [2025-03-08 07:51:23,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:23,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 589 [2025-03-08 07:51:23,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:23,422 INFO L225 Difference]: With dead ends: 3508 [2025-03-08 07:51:23,422 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:51:23,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:51:23,424 INFO L435 NwaCegarLoop]: 2306 mSDtfsCounter, 5150 mSDsluCounter, 2308 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5163 SdHoareTripleChecker+Valid, 4614 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:23,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5163 Valid, 4614 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:51:23,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:51:23,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:51:23,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1910 states have (on average 1.486910994764398) internal successors, (2840), 1910 states have internal predecessors, (2840), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:23,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2866 transitions. [2025-03-08 07:51:23,441 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2866 transitions. Word has length 589 [2025-03-08 07:51:23,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:23,442 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2866 transitions. [2025-03-08 07:51:23,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:23,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2866 transitions. [2025-03-08 07:51:23,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2025-03-08 07:51:23,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:23,444 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:23,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:51:23,444 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:23,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:23,445 INFO L85 PathProgramCache]: Analyzing trace with hash -570266250, now seen corresponding path program 1 times [2025-03-08 07:51:23,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:23,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604577242] [2025-03-08 07:51:23,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:23,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:23,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-03-08 07:51:23,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-03-08 07:51:23,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:23,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:24,326 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:24,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:24,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604577242] [2025-03-08 07:51:24,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604577242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:24,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:24,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:24,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636572589] [2025-03-08 07:51:24,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:24,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:24,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:24,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:24,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:24,328 INFO L87 Difference]: Start difference. First operand 1925 states and 2866 transitions. Second operand has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:24,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:24,885 INFO L93 Difference]: Finished difference Result 3508 states and 5220 transitions. [2025-03-08 07:51:24,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:24,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 590 [2025-03-08 07:51:24,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:24,888 INFO L225 Difference]: With dead ends: 3508 [2025-03-08 07:51:24,889 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:51:24,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:51:24,891 INFO L435 NwaCegarLoop]: 2306 mSDtfsCounter, 5048 mSDsluCounter, 2308 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5061 SdHoareTripleChecker+Valid, 4614 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:24,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5061 Valid, 4614 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:51:24,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:51:24,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:51:24,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1910 states have (on average 1.486387434554974) internal successors, (2839), 1910 states have internal predecessors, (2839), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:24,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2865 transitions. [2025-03-08 07:51:24,917 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2865 transitions. Word has length 590 [2025-03-08 07:51:24,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:24,917 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2865 transitions. [2025-03-08 07:51:24,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2865 transitions. [2025-03-08 07:51:24,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2025-03-08 07:51:24,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:24,921 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:24,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:51:24,921 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:24,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:24,922 INFO L85 PathProgramCache]: Analyzing trace with hash -552340494, now seen corresponding path program 1 times [2025-03-08 07:51:24,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:24,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059290604] [2025-03-08 07:51:24,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:24,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:25,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 591 statements into 1 equivalence classes. [2025-03-08 07:51:25,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 591 of 591 statements. [2025-03-08 07:51:25,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:25,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:25,842 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:25,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:25,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059290604] [2025-03-08 07:51:25,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059290604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:25,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:25,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:51:25,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413982081] [2025-03-08 07:51:25,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:25,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:51:25,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:25,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:51:25,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:51:25,846 INFO L87 Difference]: Start difference. First operand 1925 states and 2865 transitions. Second operand has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:26,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:26,475 INFO L93 Difference]: Finished difference Result 3508 states and 5218 transitions. [2025-03-08 07:51:26,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:26,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 591 [2025-03-08 07:51:26,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:26,478 INFO L225 Difference]: With dead ends: 3508 [2025-03-08 07:51:26,479 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:51:26,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-08 07:51:26,480 INFO L435 NwaCegarLoop]: 2238 mSDtfsCounter, 2364 mSDsluCounter, 2240 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2364 SdHoareTripleChecker+Valid, 4478 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:26,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2364 Valid, 4478 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:51:26,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:51:26,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:51:26,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1910 states have (on average 1.4858638743455497) internal successors, (2838), 1910 states have internal predecessors, (2838), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:26,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2864 transitions. [2025-03-08 07:51:26,496 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2864 transitions. Word has length 591 [2025-03-08 07:51:26,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:26,496 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2864 transitions. [2025-03-08 07:51:26,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:26,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2864 transitions. [2025-03-08 07:51:26,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2025-03-08 07:51:26,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:26,499 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:26,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 07:51:26,499 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:26,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:26,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1852725457, now seen corresponding path program 1 times [2025-03-08 07:51:26,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:26,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638634882] [2025-03-08 07:51:26,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:26,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:26,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-03-08 07:51:26,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-03-08 07:51:26,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:26,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:27,146 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:27,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:27,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638634882] [2025-03-08 07:51:27,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638634882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:27,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:27,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:27,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281155539] [2025-03-08 07:51:27,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:27,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:27,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:27,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:27,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:27,148 INFO L87 Difference]: Start difference. First operand 1925 states and 2864 transitions. Second operand has 5 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:27,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:27,882 INFO L93 Difference]: Finished difference Result 3754 states and 5574 transitions. [2025-03-08 07:51:27,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:51:27,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 592 [2025-03-08 07:51:27,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:27,887 INFO L225 Difference]: With dead ends: 3754 [2025-03-08 07:51:27,887 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:51:27,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:51:27,889 INFO L435 NwaCegarLoop]: 2363 mSDtfsCounter, 3051 mSDsluCounter, 4615 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3051 SdHoareTripleChecker+Valid, 6978 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:27,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3051 Valid, 6978 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:51:27,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:51:27,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:51:27,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1910 states have (on average 1.4853403141361257) internal successors, (2837), 1910 states have internal predecessors, (2837), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:27,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2863 transitions. [2025-03-08 07:51:27,913 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2863 transitions. Word has length 592 [2025-03-08 07:51:27,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:27,913 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2863 transitions. [2025-03-08 07:51:27,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:27,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2863 transitions. [2025-03-08 07:51:27,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-03-08 07:51:27,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:27,917 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:27,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:51:27,917 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:27,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:27,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1542602405, now seen corresponding path program 1 times [2025-03-08 07:51:27,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:27,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274037922] [2025-03-08 07:51:27,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:27,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:28,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-03-08 07:51:28,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-03-08 07:51:28,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:28,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:28,507 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:28,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:28,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274037922] [2025-03-08 07:51:28,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274037922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:28,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:28,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:28,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245948595] [2025-03-08 07:51:28,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:28,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:28,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:28,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:28,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:28,508 INFO L87 Difference]: Start difference. First operand 1925 states and 2863 transitions. Second operand has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:29,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:29,149 INFO L93 Difference]: Finished difference Result 3508 states and 5214 transitions. [2025-03-08 07:51:29,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:29,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 593 [2025-03-08 07:51:29,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:29,152 INFO L225 Difference]: With dead ends: 3508 [2025-03-08 07:51:29,152 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:51:29,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:51:29,154 INFO L435 NwaCegarLoop]: 2238 mSDtfsCounter, 2827 mSDsluCounter, 2257 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2840 SdHoareTripleChecker+Valid, 4495 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:29,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2840 Valid, 4495 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:51:29,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:51:29,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:51:29,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1910 states have (on average 1.4848167539267016) internal successors, (2836), 1910 states have internal predecessors, (2836), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:29,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2862 transitions. [2025-03-08 07:51:29,170 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2862 transitions. Word has length 593 [2025-03-08 07:51:29,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:29,170 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2862 transitions. [2025-03-08 07:51:29,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:29,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2862 transitions. [2025-03-08 07:51:29,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-03-08 07:51:29,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:29,173 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:29,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 07:51:29,174 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:29,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:29,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1497727574, now seen corresponding path program 1 times [2025-03-08 07:51:29,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:29,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316873843] [2025-03-08 07:51:29,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:29,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:29,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-03-08 07:51:29,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-03-08 07:51:29,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:29,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:29,779 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:29,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:29,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316873843] [2025-03-08 07:51:29,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316873843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:29,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:29,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:29,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219763199] [2025-03-08 07:51:29,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:29,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:29,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:29,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:29,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:29,780 INFO L87 Difference]: Start difference. First operand 1925 states and 2862 transitions. Second operand has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:30,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:30,417 INFO L93 Difference]: Finished difference Result 3508 states and 5212 transitions. [2025-03-08 07:51:30,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:30,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 594 [2025-03-08 07:51:30,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:30,421 INFO L225 Difference]: With dead ends: 3508 [2025-03-08 07:51:30,421 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:51:30,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:51:30,423 INFO L435 NwaCegarLoop]: 2238 mSDtfsCounter, 2823 mSDsluCounter, 2257 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2836 SdHoareTripleChecker+Valid, 4495 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:30,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2836 Valid, 4495 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:51:30,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:51:30,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:51:30,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1910 states have (on average 1.4842931937172774) internal successors, (2835), 1910 states have internal predecessors, (2835), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:30,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2861 transitions. [2025-03-08 07:51:30,437 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2861 transitions. Word has length 594 [2025-03-08 07:51:30,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:30,438 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2861 transitions. [2025-03-08 07:51:30,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:30,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2861 transitions. [2025-03-08 07:51:30,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2025-03-08 07:51:30,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:30,441 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:30,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 07:51:30,441 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:30,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:30,442 INFO L85 PathProgramCache]: Analyzing trace with hash -139246016, now seen corresponding path program 1 times [2025-03-08 07:51:30,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:30,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686706433] [2025-03-08 07:51:30,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:30,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:30,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 595 statements into 1 equivalence classes. [2025-03-08 07:51:30,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 595 of 595 statements. [2025-03-08 07:51:30,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:30,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:31,089 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:31,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:31,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686706433] [2025-03-08 07:51:31,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686706433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:31,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:31,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:31,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826750756] [2025-03-08 07:51:31,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:31,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:31,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:31,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:31,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:31,091 INFO L87 Difference]: Start difference. First operand 1925 states and 2861 transitions. Second operand has 5 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:31,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:31,767 INFO L93 Difference]: Finished difference Result 3508 states and 5210 transitions. [2025-03-08 07:51:31,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:31,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 595 [2025-03-08 07:51:31,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:31,771 INFO L225 Difference]: With dead ends: 3508 [2025-03-08 07:51:31,771 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:51:31,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:51:31,774 INFO L435 NwaCegarLoop]: 2238 mSDtfsCounter, 5316 mSDsluCounter, 2240 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5329 SdHoareTripleChecker+Valid, 4478 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:31,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5329 Valid, 4478 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:51:31,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:51:31,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:51:31,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1910 states have (on average 1.4837696335078534) internal successors, (2834), 1910 states have internal predecessors, (2834), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:31,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2860 transitions. [2025-03-08 07:51:31,799 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2860 transitions. Word has length 595 [2025-03-08 07:51:31,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:31,800 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2860 transitions. [2025-03-08 07:51:31,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:31,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2860 transitions. [2025-03-08 07:51:31,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2025-03-08 07:51:31,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:31,805 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:31,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 07:51:31,805 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:31,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:31,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1604255141, now seen corresponding path program 1 times [2025-03-08 07:51:31,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:31,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204850682] [2025-03-08 07:51:31,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:31,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:31,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-03-08 07:51:32,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-03-08 07:51:32,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:32,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:32,474 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:32,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:32,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204850682] [2025-03-08 07:51:32,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204850682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:32,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:32,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:32,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231615886] [2025-03-08 07:51:32,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:32,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:32,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:32,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:32,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:32,475 INFO L87 Difference]: Start difference. First operand 1925 states and 2860 transitions. Second operand has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:33,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:33,094 INFO L93 Difference]: Finished difference Result 3508 states and 5208 transitions. [2025-03-08 07:51:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:33,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 596 [2025-03-08 07:51:33,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:33,100 INFO L225 Difference]: With dead ends: 3508 [2025-03-08 07:51:33,100 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:51:33,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:51:33,102 INFO L435 NwaCegarLoop]: 2238 mSDtfsCounter, 5226 mSDsluCounter, 2240 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5239 SdHoareTripleChecker+Valid, 4478 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:33,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5239 Valid, 4478 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:51:33,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:51:33,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:51:33,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1910 states have (on average 1.4832460732984294) internal successors, (2833), 1910 states have internal predecessors, (2833), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:33,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2859 transitions. [2025-03-08 07:51:33,119 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2859 transitions. Word has length 596 [2025-03-08 07:51:33,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:33,122 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2859 transitions. [2025-03-08 07:51:33,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:33,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2859 transitions. [2025-03-08 07:51:33,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-03-08 07:51:33,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:33,125 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:33,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 07:51:33,125 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:33,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:33,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1425628112, now seen corresponding path program 1 times [2025-03-08 07:51:33,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:33,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793048577] [2025-03-08 07:51:33,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:33,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:33,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-03-08 07:51:33,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-03-08 07:51:33,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:33,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:33,756 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:33,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:33,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793048577] [2025-03-08 07:51:33,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793048577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:33,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:33,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:33,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117633022] [2025-03-08 07:51:33,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:33,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:33,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:33,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:33,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:33,757 INFO L87 Difference]: Start difference. First operand 1925 states and 2859 transitions. Second operand has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:34,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:34,402 INFO L93 Difference]: Finished difference Result 3508 states and 5206 transitions. [2025-03-08 07:51:34,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:34,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 597 [2025-03-08 07:51:34,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:34,406 INFO L225 Difference]: With dead ends: 3508 [2025-03-08 07:51:34,406 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:51:34,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:51:34,407 INFO L435 NwaCegarLoop]: 2238 mSDtfsCounter, 5218 mSDsluCounter, 2240 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5231 SdHoareTripleChecker+Valid, 4478 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:34,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5231 Valid, 4478 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:51:34,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:51:34,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:51:34,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1910 states have (on average 1.4827225130890052) internal successors, (2832), 1910 states have internal predecessors, (2832), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:34,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2858 transitions. [2025-03-08 07:51:34,424 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2858 transitions. Word has length 597 [2025-03-08 07:51:34,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:34,424 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2858 transitions. [2025-03-08 07:51:34,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:34,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2858 transitions. [2025-03-08 07:51:34,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-03-08 07:51:34,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:34,427 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:34,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 07:51:34,427 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:34,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:34,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1447081450, now seen corresponding path program 1 times [2025-03-08 07:51:34,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:34,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331099759] [2025-03-08 07:51:34,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:34,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:34,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-03-08 07:51:34,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-03-08 07:51:34,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:34,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:35,044 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:35,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:35,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331099759] [2025-03-08 07:51:35,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331099759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:35,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:35,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:35,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538507438] [2025-03-08 07:51:35,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:35,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:35,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:35,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:35,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:35,045 INFO L87 Difference]: Start difference. First operand 1925 states and 2858 transitions. Second operand has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:35,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:35,669 INFO L93 Difference]: Finished difference Result 3508 states and 5204 transitions. [2025-03-08 07:51:35,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:35,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 598 [2025-03-08 07:51:35,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:35,671 INFO L225 Difference]: With dead ends: 3508 [2025-03-08 07:51:35,671 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:51:35,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:51:35,673 INFO L435 NwaCegarLoop]: 2238 mSDtfsCounter, 5210 mSDsluCounter, 2240 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5223 SdHoareTripleChecker+Valid, 4478 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:35,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5223 Valid, 4478 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:51:35,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:51:35,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:51:35,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1910 states have (on average 1.4821989528795811) internal successors, (2831), 1910 states have internal predecessors, (2831), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:35,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2857 transitions. [2025-03-08 07:51:35,690 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2857 transitions. Word has length 598 [2025-03-08 07:51:35,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:35,690 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2857 transitions. [2025-03-08 07:51:35,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:35,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2857 transitions. [2025-03-08 07:51:35,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2025-03-08 07:51:35,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:35,693 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:35,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 07:51:35,693 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:35,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:35,694 INFO L85 PathProgramCache]: Analyzing trace with hash 277608651, now seen corresponding path program 1 times [2025-03-08 07:51:35,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:35,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200155264] [2025-03-08 07:51:35,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:35,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:35,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes. [2025-03-08 07:51:35,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements. [2025-03-08 07:51:35,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:35,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:36,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:36,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200155264] [2025-03-08 07:51:36,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200155264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:36,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:36,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:36,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103455748] [2025-03-08 07:51:36,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:36,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:36,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:36,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:36,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:36,331 INFO L87 Difference]: Start difference. First operand 1925 states and 2857 transitions. Second operand has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:36,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:36,969 INFO L93 Difference]: Finished difference Result 3508 states and 5202 transitions. [2025-03-08 07:51:36,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:36,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 599 [2025-03-08 07:51:36,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:36,972 INFO L225 Difference]: With dead ends: 3508 [2025-03-08 07:51:36,972 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:51:36,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:51:36,973 INFO L435 NwaCegarLoop]: 2238 mSDtfsCounter, 2762 mSDsluCounter, 2257 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2775 SdHoareTripleChecker+Valid, 4495 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:36,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2775 Valid, 4495 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:51:36,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:51:36,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:51:36,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1910 states have (on average 1.4816753926701571) internal successors, (2830), 1910 states have internal predecessors, (2830), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2856 transitions. [2025-03-08 07:51:36,988 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2856 transitions. Word has length 599 [2025-03-08 07:51:36,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:36,988 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2856 transitions. [2025-03-08 07:51:36,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:36,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2856 transitions. [2025-03-08 07:51:36,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2025-03-08 07:51:36,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:36,991 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:36,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 07:51:36,991 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:36,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:36,992 INFO L85 PathProgramCache]: Analyzing trace with hash 489681745, now seen corresponding path program 1 times [2025-03-08 07:51:36,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:36,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428263304] [2025-03-08 07:51:36,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:36,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:37,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 600 statements into 1 equivalence classes. [2025-03-08 07:51:37,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 600 of 600 statements. [2025-03-08 07:51:37,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:37,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:37,648 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:37,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:37,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428263304] [2025-03-08 07:51:37,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428263304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:37,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:37,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:37,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28875377] [2025-03-08 07:51:37,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:37,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:37,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:37,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:37,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:37,650 INFO L87 Difference]: Start difference. First operand 1925 states and 2856 transitions. Second operand has 5 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:38,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:38,257 INFO L93 Difference]: Finished difference Result 3508 states and 5200 transitions. [2025-03-08 07:51:38,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:38,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 600 [2025-03-08 07:51:38,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:38,259 INFO L225 Difference]: With dead ends: 3508 [2025-03-08 07:51:38,259 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:51:38,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:51:38,261 INFO L435 NwaCegarLoop]: 2238 mSDtfsCounter, 2717 mSDsluCounter, 2257 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2730 SdHoareTripleChecker+Valid, 4495 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:38,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2730 Valid, 4495 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:51:38,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:51:38,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:51:38,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1910 states have (on average 1.481151832460733) internal successors, (2829), 1910 states have internal predecessors, (2829), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:38,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2855 transitions. [2025-03-08 07:51:38,279 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2855 transitions. Word has length 600 [2025-03-08 07:51:38,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:38,280 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2855 transitions. [2025-03-08 07:51:38,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:38,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2855 transitions. [2025-03-08 07:51:38,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2025-03-08 07:51:38,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:38,282 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:38,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 07:51:38,282 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:38,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:38,283 INFO L85 PathProgramCache]: Analyzing trace with hash -698319621, now seen corresponding path program 1 times [2025-03-08 07:51:38,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:38,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002155408] [2025-03-08 07:51:38,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:38,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:38,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-03-08 07:51:38,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-03-08 07:51:38,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:38,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:38,884 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:38,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:38,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002155408] [2025-03-08 07:51:38,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002155408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:38,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:38,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:38,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901724544] [2025-03-08 07:51:38,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:38,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:38,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:38,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:38,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:38,885 INFO L87 Difference]: Start difference. First operand 1925 states and 2855 transitions. Second operand has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:39,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:39,510 INFO L93 Difference]: Finished difference Result 3508 states and 5198 transitions. [2025-03-08 07:51:39,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:39,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 601 [2025-03-08 07:51:39,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:39,512 INFO L225 Difference]: With dead ends: 3508 [2025-03-08 07:51:39,512 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:51:39,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:51:39,515 INFO L435 NwaCegarLoop]: 2238 mSDtfsCounter, 5104 mSDsluCounter, 2240 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5117 SdHoareTripleChecker+Valid, 4478 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:39,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5117 Valid, 4478 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:51:39,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:51:39,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:51:39,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1910 states have (on average 1.4806282722513089) internal successors, (2828), 1910 states have internal predecessors, (2828), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:39,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2854 transitions. [2025-03-08 07:51:39,532 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2854 transitions. Word has length 601 [2025-03-08 07:51:39,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:39,533 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2854 transitions. [2025-03-08 07:51:39,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:39,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2854 transitions. [2025-03-08 07:51:39,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2025-03-08 07:51:39,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:39,536 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:39,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 07:51:39,536 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:39,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:39,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2131528214, now seen corresponding path program 1 times [2025-03-08 07:51:39,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:39,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436063991] [2025-03-08 07:51:39,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:39,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:39,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 602 statements into 1 equivalence classes. [2025-03-08 07:51:39,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 602 of 602 statements. [2025-03-08 07:51:39,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:39,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:40,168 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:40,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:40,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436063991] [2025-03-08 07:51:40,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436063991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:40,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:40,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:40,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751344726] [2025-03-08 07:51:40,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:40,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:40,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:40,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:40,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:40,170 INFO L87 Difference]: Start difference. First operand 1925 states and 2854 transitions. Second operand has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:40,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:40,800 INFO L93 Difference]: Finished difference Result 3508 states and 5196 transitions. [2025-03-08 07:51:40,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:40,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 602 [2025-03-08 07:51:40,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:40,802 INFO L225 Difference]: With dead ends: 3508 [2025-03-08 07:51:40,802 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:51:40,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:51:40,804 INFO L435 NwaCegarLoop]: 2238 mSDtfsCounter, 5096 mSDsluCounter, 2240 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5109 SdHoareTripleChecker+Valid, 4478 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:40,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5109 Valid, 4478 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1234 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:51:40,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:51:40,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:51:40,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1910 states have (on average 1.4801047120418849) internal successors, (2827), 1910 states have internal predecessors, (2827), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:40,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2853 transitions. [2025-03-08 07:51:40,817 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2853 transitions. Word has length 602 [2025-03-08 07:51:40,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:40,818 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2853 transitions. [2025-03-08 07:51:40,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:40,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2853 transitions. [2025-03-08 07:51:40,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2025-03-08 07:51:40,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:40,820 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:40,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 07:51:40,821 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:40,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:40,821 INFO L85 PathProgramCache]: Analyzing trace with hash -609083616, now seen corresponding path program 1 times [2025-03-08 07:51:40,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:40,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811503641] [2025-03-08 07:51:40,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:40,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:40,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 603 statements into 1 equivalence classes. [2025-03-08 07:51:41,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 603 of 603 statements. [2025-03-08 07:51:41,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:41,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:41,437 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:41,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:41,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811503641] [2025-03-08 07:51:41,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811503641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:41,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:41,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:41,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888258884] [2025-03-08 07:51:41,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:41,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:41,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:41,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:41,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:41,439 INFO L87 Difference]: Start difference. First operand 1925 states and 2853 transitions. Second operand has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:42,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:42,045 INFO L93 Difference]: Finished difference Result 3508 states and 5194 transitions. [2025-03-08 07:51:42,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:42,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 603 [2025-03-08 07:51:42,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:42,048 INFO L225 Difference]: With dead ends: 3508 [2025-03-08 07:51:42,048 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:51:42,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:51:42,049 INFO L435 NwaCegarLoop]: 2238 mSDtfsCounter, 5088 mSDsluCounter, 2240 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5101 SdHoareTripleChecker+Valid, 4478 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:42,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5101 Valid, 4478 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:51:42,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:51:42,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:51:42,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1910 states have (on average 1.4795811518324606) internal successors, (2826), 1910 states have internal predecessors, (2826), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:42,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2852 transitions. [2025-03-08 07:51:42,066 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2852 transitions. Word has length 603 [2025-03-08 07:51:42,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:42,066 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2852 transitions. [2025-03-08 07:51:42,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:42,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2852 transitions. [2025-03-08 07:51:42,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2025-03-08 07:51:42,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:42,069 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:42,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 07:51:42,069 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:42,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:42,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1318721371, now seen corresponding path program 1 times [2025-03-08 07:51:42,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:42,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772034151] [2025-03-08 07:51:42,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:42,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:42,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 604 statements into 1 equivalence classes. [2025-03-08 07:51:42,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 604 of 604 statements. [2025-03-08 07:51:42,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:42,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:42,785 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:42,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:42,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772034151] [2025-03-08 07:51:42,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772034151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:42,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:42,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:42,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508012903] [2025-03-08 07:51:42,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:42,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:42,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:42,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:42,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:42,787 INFO L87 Difference]: Start difference. First operand 1925 states and 2852 transitions. Second operand has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:43,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:43,417 INFO L93 Difference]: Finished difference Result 3508 states and 5192 transitions. [2025-03-08 07:51:43,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:43,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 604 [2025-03-08 07:51:43,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:43,419 INFO L225 Difference]: With dead ends: 3508 [2025-03-08 07:51:43,419 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:51:43,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:51:43,422 INFO L435 NwaCegarLoop]: 2238 mSDtfsCounter, 4990 mSDsluCounter, 2240 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5003 SdHoareTripleChecker+Valid, 4478 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:43,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5003 Valid, 4478 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:51:43,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:51:43,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:51:43,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1910 states have (on average 1.4790575916230366) internal successors, (2825), 1910 states have internal predecessors, (2825), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:43,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2851 transitions. [2025-03-08 07:51:43,439 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2851 transitions. Word has length 604 [2025-03-08 07:51:43,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:43,439 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2851 transitions. [2025-03-08 07:51:43,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:43,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2851 transitions. [2025-03-08 07:51:43,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2025-03-08 07:51:43,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:43,442 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:43,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 07:51:43,442 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:43,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:43,443 INFO L85 PathProgramCache]: Analyzing trace with hash 572717347, now seen corresponding path program 1 times [2025-03-08 07:51:43,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:43,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560600532] [2025-03-08 07:51:43,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:43,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:43,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 605 statements into 1 equivalence classes. [2025-03-08 07:51:43,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 605 of 605 statements. [2025-03-08 07:51:43,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:43,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:44,105 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:44,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:44,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560600532] [2025-03-08 07:51:44,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560600532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:44,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:44,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:44,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683314650] [2025-03-08 07:51:44,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:44,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:44,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:44,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:44,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:44,106 INFO L87 Difference]: Start difference. First operand 1925 states and 2851 transitions. Second operand has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:44,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:44,718 INFO L93 Difference]: Finished difference Result 3508 states and 5190 transitions. [2025-03-08 07:51:44,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:44,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 605 [2025-03-08 07:51:44,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:44,720 INFO L225 Difference]: With dead ends: 3508 [2025-03-08 07:51:44,720 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:51:44,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:51:44,722 INFO L435 NwaCegarLoop]: 2238 mSDtfsCounter, 4982 mSDsluCounter, 2240 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4995 SdHoareTripleChecker+Valid, 4478 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:44,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4995 Valid, 4478 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:51:44,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:51:44,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:51:44,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1910 states have (on average 1.4785340314136126) internal successors, (2824), 1910 states have internal predecessors, (2824), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:44,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2850 transitions. [2025-03-08 07:51:44,738 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2850 transitions. Word has length 605 [2025-03-08 07:51:44,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:44,738 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2850 transitions. [2025-03-08 07:51:44,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:44,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2850 transitions. [2025-03-08 07:51:44,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2025-03-08 07:51:44,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:44,741 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:44,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 07:51:44,742 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:44,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:44,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1568117174, now seen corresponding path program 1 times [2025-03-08 07:51:44,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:44,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728176653] [2025-03-08 07:51:44,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:44,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:44,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-03-08 07:51:44,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-03-08 07:51:44,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:44,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:45,387 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:45,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:45,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728176653] [2025-03-08 07:51:45,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728176653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:45,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:45,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:45,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319982216] [2025-03-08 07:51:45,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:45,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:45,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:45,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:45,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:45,388 INFO L87 Difference]: Start difference. First operand 1925 states and 2850 transitions. Second operand has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:46,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:46,015 INFO L93 Difference]: Finished difference Result 3508 states and 5188 transitions. [2025-03-08 07:51:46,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:46,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 606 [2025-03-08 07:51:46,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:46,017 INFO L225 Difference]: With dead ends: 3508 [2025-03-08 07:51:46,017 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:51:46,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:51:46,019 INFO L435 NwaCegarLoop]: 2238 mSDtfsCounter, 4974 mSDsluCounter, 2240 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4987 SdHoareTripleChecker+Valid, 4478 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:46,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4987 Valid, 4478 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:51:46,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:51:46,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:51:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1910 states have (on average 1.4780104712041884) internal successors, (2823), 1910 states have internal predecessors, (2823), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:46,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2849 transitions. [2025-03-08 07:51:46,039 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2849 transitions. Word has length 606 [2025-03-08 07:51:46,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:46,040 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2849 transitions. [2025-03-08 07:51:46,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:46,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2849 transitions. [2025-03-08 07:51:46,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2025-03-08 07:51:46,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:46,043 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:46,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 07:51:46,043 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:46,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:46,043 INFO L85 PathProgramCache]: Analyzing trace with hash 486401950, now seen corresponding path program 1 times [2025-03-08 07:51:46,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:46,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863507061] [2025-03-08 07:51:46,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:46,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:46,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-03-08 07:51:46,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-03-08 07:51:46,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:46,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:47,115 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:47,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:47,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863507061] [2025-03-08 07:51:47,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863507061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:47,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:47,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:51:47,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250666916] [2025-03-08 07:51:47,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:47,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:51:47,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:47,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:51:47,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:51:47,116 INFO L87 Difference]: Start difference. First operand 1925 states and 2849 transitions. Second operand has 4 states, 4 states have (on average 136.25) internal successors, (545), 4 states have internal predecessors, (545), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:47,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:47,709 INFO L93 Difference]: Finished difference Result 3508 states and 5186 transitions. [2025-03-08 07:51:47,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:47,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 136.25) internal successors, (545), 4 states have internal predecessors, (545), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 607 [2025-03-08 07:51:47,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:47,711 INFO L225 Difference]: With dead ends: 3508 [2025-03-08 07:51:47,711 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:51:47,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-08 07:51:47,713 INFO L435 NwaCegarLoop]: 2290 mSDtfsCounter, 2501 mSDsluCounter, 2292 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2501 SdHoareTripleChecker+Valid, 4582 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:47,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2501 Valid, 4582 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:51:47,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:51:47,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:51:47,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1910 states have (on average 1.4774869109947644) internal successors, (2822), 1910 states have internal predecessors, (2822), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:47,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2848 transitions. [2025-03-08 07:51:47,729 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2848 transitions. Word has length 607 [2025-03-08 07:51:47,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:47,729 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2848 transitions. [2025-03-08 07:51:47,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.25) internal successors, (545), 4 states have internal predecessors, (545), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:47,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2848 transitions. [2025-03-08 07:51:47,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-08 07:51:47,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:47,732 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:47,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 07:51:47,733 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:47,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:47,733 INFO L85 PathProgramCache]: Analyzing trace with hash -385608623, now seen corresponding path program 1 times [2025-03-08 07:51:47,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:47,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988081440] [2025-03-08 07:51:47,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:47,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:47,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-08 07:51:48,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-08 07:51:48,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:48,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:48,806 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:48,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:48,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988081440] [2025-03-08 07:51:48,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988081440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:48,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:48,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:51:48,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503977307] [2025-03-08 07:51:48,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:48,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:51:48,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:48,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:51:48,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:51:48,808 INFO L87 Difference]: Start difference. First operand 1925 states and 2848 transitions. Second operand has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:49,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:49,325 INFO L93 Difference]: Finished difference Result 3508 states and 5184 transitions. [2025-03-08 07:51:49,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:49,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 608 [2025-03-08 07:51:49,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:49,328 INFO L225 Difference]: With dead ends: 3508 [2025-03-08 07:51:49,328 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:51:49,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-08 07:51:49,329 INFO L435 NwaCegarLoop]: 2290 mSDtfsCounter, 2446 mSDsluCounter, 2292 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2446 SdHoareTripleChecker+Valid, 4582 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:49,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2446 Valid, 4582 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:51:49,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:51:49,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:51:49,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1910 states have (on average 1.4769633507853404) internal successors, (2821), 1910 states have internal predecessors, (2821), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:49,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2847 transitions. [2025-03-08 07:51:49,343 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2847 transitions. Word has length 608 [2025-03-08 07:51:49,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:49,343 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2847 transitions. [2025-03-08 07:51:49,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:49,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2847 transitions. [2025-03-08 07:51:49,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2025-03-08 07:51:49,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:49,346 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:49,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 07:51:49,346 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:49,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:49,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1168310541, now seen corresponding path program 1 times [2025-03-08 07:51:49,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:49,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205290904] [2025-03-08 07:51:49,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:49,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:49,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes. [2025-03-08 07:51:49,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements. [2025-03-08 07:51:49,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:49,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:50,626 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:50,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:50,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205290904] [2025-03-08 07:51:50,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205290904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:50,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:50,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:51:50,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308203054] [2025-03-08 07:51:50,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:50,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:51:50,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:50,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:51:50,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:51:50,627 INFO L87 Difference]: Start difference. First operand 1925 states and 2847 transitions. Second operand has 4 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:51,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:51,152 INFO L93 Difference]: Finished difference Result 3508 states and 5182 transitions. [2025-03-08 07:51:51,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:51,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 609 [2025-03-08 07:51:51,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:51,154 INFO L225 Difference]: With dead ends: 3508 [2025-03-08 07:51:51,154 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 07:51:51,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-08 07:51:51,155 INFO L435 NwaCegarLoop]: 2290 mSDtfsCounter, 2391 mSDsluCounter, 2292 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2391 SdHoareTripleChecker+Valid, 4582 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:51,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2391 Valid, 4582 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:51:51,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 07:51:51,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2025-03-08 07:51:51,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1910 states have (on average 1.4764397905759161) internal successors, (2820), 1910 states have internal predecessors, (2820), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 07:51:51,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2846 transitions. [2025-03-08 07:51:51,171 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2846 transitions. Word has length 609 [2025-03-08 07:51:51,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:51,172 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2846 transitions. [2025-03-08 07:51:51,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:51,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2846 transitions. [2025-03-08 07:51:51,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611 [2025-03-08 07:51:51,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:51,174 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:51,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 07:51:51,175 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:51,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:51,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1032955999, now seen corresponding path program 1 times [2025-03-08 07:51:51,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:51,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715182381] [2025-03-08 07:51:51,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:51,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:51,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 610 statements into 1 equivalence classes. [2025-03-08 07:51:51,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 610 of 610 statements. [2025-03-08 07:51:51,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:51,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:52,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:52,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715182381] [2025-03-08 07:51:52,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715182381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:52,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:52,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:51:52,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430014845] [2025-03-08 07:51:52,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:52,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:51:52,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:52,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:51:52,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:51:52,728 INFO L87 Difference]: Start difference. First operand 1925 states and 2846 transitions. Second operand has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 07:51:53,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:53,996 INFO L93 Difference]: Finished difference Result 5080 states and 7499 transitions. [2025-03-08 07:51:53,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:51:53,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 610 [2025-03-08 07:51:53,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:54,000 INFO L225 Difference]: With dead ends: 5080 [2025-03-08 07:51:54,000 INFO L226 Difference]: Without dead ends: 3477 [2025-03-08 07:51:54,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:51:54,002 INFO L435 NwaCegarLoop]: 2362 mSDtfsCounter, 2240 mSDsluCounter, 8893 mSDsCounter, 0 mSdLazyCounter, 2954 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2249 SdHoareTripleChecker+Valid, 11255 SdHoareTripleChecker+Invalid, 2957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:54,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2249 Valid, 11255 Invalid, 2957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2954 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 07:51:54,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3477 states. [2025-03-08 07:51:54,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3477 to 2040. [2025-03-08 07:51:54,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2040 states, 2021 states have (on average 1.4760019792182089) internal successors, (2983), 2021 states have internal predecessors, (2983), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 07:51:54,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 3017 transitions. [2025-03-08 07:51:54,030 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 3017 transitions. Word has length 610 [2025-03-08 07:51:54,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:54,030 INFO L471 AbstractCegarLoop]: Abstraction has 2040 states and 3017 transitions. [2025-03-08 07:51:54,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 3 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 07:51:54,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 3017 transitions. [2025-03-08 07:51:54,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2025-03-08 07:51:54,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:54,034 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:54,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 07:51:54,034 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:54,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:54,035 INFO L85 PathProgramCache]: Analyzing trace with hash -675110299, now seen corresponding path program 1 times [2025-03-08 07:51:54,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:54,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231724656] [2025-03-08 07:51:54,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:54,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:54,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 611 statements into 1 equivalence classes. [2025-03-08 07:51:55,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 611 of 611 statements. [2025-03-08 07:51:55,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:55,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:55,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:55,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231724656] [2025-03-08 07:51:55,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231724656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:55,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:55,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:55,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377660641] [2025-03-08 07:51:55,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:55,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:55,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:55,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:55,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:55,570 INFO L87 Difference]: Start difference. First operand 2040 states and 3017 transitions. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:56,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:56,463 INFO L93 Difference]: Finished difference Result 3623 states and 5351 transitions. [2025-03-08 07:51:56,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:56,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 611 [2025-03-08 07:51:56,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:56,466 INFO L225 Difference]: With dead ends: 3623 [2025-03-08 07:51:56,466 INFO L226 Difference]: Without dead ends: 2040 [2025-03-08 07:51:56,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:51:56,468 INFO L435 NwaCegarLoop]: 2235 mSDtfsCounter, 2491 mSDsluCounter, 4457 mSDsCounter, 0 mSdLazyCounter, 1842 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2491 SdHoareTripleChecker+Valid, 6692 SdHoareTripleChecker+Invalid, 1842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:56,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2491 Valid, 6692 Invalid, 1842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1842 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 07:51:56,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states. [2025-03-08 07:51:56,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 2040. [2025-03-08 07:51:56,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2040 states, 2021 states have (on average 1.475507174666007) internal successors, (2982), 2021 states have internal predecessors, (2982), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 07:51:56,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 3016 transitions. [2025-03-08 07:51:56,485 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 3016 transitions. Word has length 611 [2025-03-08 07:51:56,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:56,485 INFO L471 AbstractCegarLoop]: Abstraction has 2040 states and 3016 transitions. [2025-03-08 07:51:56,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:56,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 3016 transitions. [2025-03-08 07:51:56,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2025-03-08 07:51:56,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:56,488 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:56,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 07:51:56,488 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:56,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:56,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1155805090, now seen corresponding path program 1 times [2025-03-08 07:51:56,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:56,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724305511] [2025-03-08 07:51:56,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:56,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:56,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 612 statements into 1 equivalence classes. [2025-03-08 07:51:57,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 612 of 612 statements. [2025-03-08 07:51:57,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:51:57,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:51:58,049 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-08 07:51:58,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:51:58,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724305511] [2025-03-08 07:51:58,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724305511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:51:58,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:51:58,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:51:58,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252429264] [2025-03-08 07:51:58,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:51:58,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:51:58,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:51:58,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:51:58,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:51:58,051 INFO L87 Difference]: Start difference. First operand 2040 states and 3016 transitions. Second operand has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:58,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:51:58,821 INFO L93 Difference]: Finished difference Result 3623 states and 5349 transitions. [2025-03-08 07:51:58,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:51:58,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 612 [2025-03-08 07:51:58,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:51:58,824 INFO L225 Difference]: With dead ends: 3623 [2025-03-08 07:51:58,824 INFO L226 Difference]: Without dead ends: 2040 [2025-03-08 07:51:58,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:51:58,826 INFO L435 NwaCegarLoop]: 2235 mSDtfsCounter, 4972 mSDsluCounter, 2237 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4972 SdHoareTripleChecker+Valid, 4472 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:51:58,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4972 Valid, 4472 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:51:58,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states. [2025-03-08 07:51:58,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 2040. [2025-03-08 07:51:58,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2040 states, 2021 states have (on average 1.4750123701138051) internal successors, (2981), 2021 states have internal predecessors, (2981), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 07:51:58,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 3015 transitions. [2025-03-08 07:51:58,846 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 3015 transitions. Word has length 612 [2025-03-08 07:51:58,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:51:58,847 INFO L471 AbstractCegarLoop]: Abstraction has 2040 states and 3015 transitions. [2025-03-08 07:51:58,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 07:51:58,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 3015 transitions. [2025-03-08 07:51:58,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2025-03-08 07:51:58,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:51:58,851 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:51:58,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 07:51:58,851 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:51:58,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:51:58,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1943369704, now seen corresponding path program 1 times [2025-03-08 07:51:58,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:51:58,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980613225] [2025-03-08 07:51:58,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:51:58,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:51:58,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 613 statements into 1 equivalence classes.