./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.unsafe_intersymbol_analog_estimation_convergence.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.unsafe_intersymbol_analog_estimation_convergence.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 2f2704c4e2c6d7f64d9e04a1e2386cc75b096498be0071ea7fbc37af2938bd44 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:25:52,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:25:52,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 18:25:52,790 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:25:52,793 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:25:52,817 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:25:52,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:25:52,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:25:52,818 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:25:52,818 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:25:52,818 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:25:52,818 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:25:52,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:25:52,819 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:25:52,820 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:25:52,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:25:52,821 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:25:52,821 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:25:52,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:25:52,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:25:52,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:25:52,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:25:52,821 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:25:52,821 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:25:52,821 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:25:52,821 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:25:52,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:25:52,822 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:25:52,822 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:25:52,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:25:52,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:25:52,822 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:25:52,822 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:25:52,823 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:25:52,823 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:25:52,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:25:52,823 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:25:52,823 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:25:52,823 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:25:52,823 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:25:52,823 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 -> 2f2704c4e2c6d7f64d9e04a1e2386cc75b096498be0071ea7fbc37af2938bd44 [2025-03-03 18:25:53,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:25:53,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:25:53,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:25:53,058 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:25:53,058 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:25:53,059 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.unsafe_intersymbol_analog_estimation_convergence.c [2025-03-03 18:25:54,178 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4396559c/2b568eba17f04f5db37373720c846d9e/FLAG61cf39abc [2025-03-03 18:25:54,454 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:25:54,455 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.unsafe_intersymbol_analog_estimation_convergence.c [2025-03-03 18:25:54,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4396559c/2b568eba17f04f5db37373720c846d9e/FLAG61cf39abc [2025-03-03 18:25:54,753 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4396559c/2b568eba17f04f5db37373720c846d9e [2025-03-03 18:25:54,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:25:54,756 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:25:54,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:25:54,757 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:25:54,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:25:54,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:25:54" (1/1) ... [2025-03-03 18:25:54,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d389e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:54, skipping insertion in model container [2025-03-03 18:25:54,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:25:54" (1/1) ... [2025-03-03 18:25:54,782 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:25:54,899 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.unsafe_intersymbol_analog_estimation_convergence.c[1313,1326] [2025-03-03 18:25:55,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:25:55,123 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:25:55,130 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.unsafe_intersymbol_analog_estimation_convergence.c[1313,1326] [2025-03-03 18:25:55,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:25:55,229 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:25:55,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:55 WrapperNode [2025-03-03 18:25:55,230 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:25:55,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:25:55,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:25:55,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:25:55,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:55" (1/1) ... [2025-03-03 18:25:55,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:55" (1/1) ... [2025-03-03 18:25:55,436 INFO L138 Inliner]: procedures = 17, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2365 [2025-03-03 18:25:55,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:25:55,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:25:55,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:25:55,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:25:55,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:55" (1/1) ... [2025-03-03 18:25:55,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:55" (1/1) ... [2025-03-03 18:25:55,465 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:55" (1/1) ... [2025-03-03 18:25:55,502 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:25:55,502 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:55" (1/1) ... [2025-03-03 18:25:55,502 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:55" (1/1) ... [2025-03-03 18:25:55,541 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:55" (1/1) ... [2025-03-03 18:25:55,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:55" (1/1) ... [2025-03-03 18:25:55,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:55" (1/1) ... [2025-03-03 18:25:55,574 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:55" (1/1) ... [2025-03-03 18:25:55,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:25:55,603 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:25:55,603 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:25:55,603 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:25:55,604 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:55" (1/1) ... [2025-03-03 18:25:55,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:25:55,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:25:55,630 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:25:55,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 18:25:55,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:25:55,651 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:25:55,651 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:25:55,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:25:55,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:25:55,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:25:55,828 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:25:55,829 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:25:57,947 INFO L? ?]: Removed 1210 outVars from TransFormulas that were not future-live. [2025-03-03 18:25:57,948 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:25:58,043 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:25:58,043 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:25:58,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:25:58 BoogieIcfgContainer [2025-03-03 18:25:58,044 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:25:58,045 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:25:58,045 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:25:58,049 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:25:58,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:25:54" (1/3) ... [2025-03-03 18:25:58,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3592bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:25:58, skipping insertion in model container [2025-03-03 18:25:58,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:25:55" (2/3) ... [2025-03-03 18:25:58,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3592bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:25:58, skipping insertion in model container [2025-03-03 18:25:58,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:25:58" (3/3) ... [2025-03-03 18:25:58,051 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.unsafe_intersymbol_analog_estimation_convergence.c [2025-03-03 18:25:58,063 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:25:58,064 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.unsafe_intersymbol_analog_estimation_convergence.c that has 2 procedures, 812 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:25:58,134 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:25:58,143 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;@df7c667, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:25:58,144 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:25:58,149 INFO L276 IsEmpty]: Start isEmpty. Operand has 812 states, 807 states have (on average 1.503097893432466) internal successors, (1213), 808 states have internal predecessors, (1213), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 18:25:58,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-03-03 18:25:58,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:25:58,169 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:25:58,170 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:25:58,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:25:58,175 INFO L85 PathProgramCache]: Analyzing trace with hash -143017033, now seen corresponding path program 1 times [2025-03-03 18:25:58,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:25:58,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263668903] [2025-03-03 18:25:58,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:58,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:25:58,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-03 18:25:58,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-03 18:25:58,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:58,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:58,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 18:25:58,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:25:58,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263668903] [2025-03-03 18:25:58,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263668903] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:25:58,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052363338] [2025-03-03 18:25:58,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:58,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:25:58,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:25:58,677 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:25:58,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 18:25:58,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-03 18:25:59,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-03 18:25:59,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:25:59,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:25:59,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 1396 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:25:59,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:25:59,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 18:25:59,141 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:25:59,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052363338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:25:59,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:25:59,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 18:25:59,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363322399] [2025-03-03 18:25:59,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:25:59,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:25:59,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:25:59,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:25:59,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:25:59,170 INFO L87 Difference]: Start difference. First operand has 812 states, 807 states have (on average 1.503097893432466) internal successors, (1213), 808 states have internal predecessors, (1213), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 143.0) internal successors, (286), 2 states have internal predecessors, (286), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 18:25:59,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:25:59,456 INFO L93 Difference]: Finished difference Result 1583 states and 2378 transitions. [2025-03-03 18:25:59,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:25:59,458 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 143.0) internal successors, (286), 2 states have internal predecessors, (286), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 291 [2025-03-03 18:25:59,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:25:59,470 INFO L225 Difference]: With dead ends: 1583 [2025-03-03 18:25:59,472 INFO L226 Difference]: Without dead ends: 809 [2025-03-03 18:25:59,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 292 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-03 18:25:59,481 INFO L435 NwaCegarLoop]: 1012 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:25:59,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1012 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:25:59,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2025-03-03 18:25:59,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 809. [2025-03-03 18:25:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 805 states have (on average 1.4956521739130435) internal successors, (1204), 805 states have internal predecessors, (1204), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 18:25:59,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1208 transitions. [2025-03-03 18:25:59,562 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1208 transitions. Word has length 291 [2025-03-03 18:25:59,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:25:59,564 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 1208 transitions. [2025-03-03 18:25:59,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 143.0) internal successors, (286), 2 states have internal predecessors, (286), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 18:25:59,565 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1208 transitions. [2025-03-03 18:25:59,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-03-03 18:25:59,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:25:59,573 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:25:59,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 18:25:59,777 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-03 18:25:59,777 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:25:59,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:25:59,778 INFO L85 PathProgramCache]: Analyzing trace with hash 234776245, now seen corresponding path program 1 times [2025-03-03 18:25:59,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:25:59,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617186464] [2025-03-03 18:25:59,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:25:59,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:25:59,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-03 18:26:00,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-03 18:26:00,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:00,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:00,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:00,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:00,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617186464] [2025-03-03 18:26:00,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617186464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:00,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:00,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:26:00,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821303098] [2025-03-03 18:26:00,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:00,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:26:00,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:00,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:26:00,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:26:00,975 INFO L87 Difference]: Start difference. First operand 809 states and 1208 transitions. Second operand has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:01,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:01,357 INFO L93 Difference]: Finished difference Result 813 states and 1212 transitions. [2025-03-03 18:26:01,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:26:01,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 291 [2025-03-03 18:26:01,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:01,361 INFO L225 Difference]: With dead ends: 813 [2025-03-03 18:26:01,361 INFO L226 Difference]: Without dead ends: 811 [2025-03-03 18:26:01,362 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-03 18:26:01,362 INFO L435 NwaCegarLoop]: 1010 mSDtfsCounter, 0 mSDsluCounter, 2015 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3025 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:01,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3025 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:26:01,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2025-03-03 18:26:01,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2025-03-03 18:26:01,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 807 states have (on average 1.4944237918215613) internal successors, (1206), 807 states have internal predecessors, (1206), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 18:26:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1210 transitions. [2025-03-03 18:26:01,379 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1210 transitions. Word has length 291 [2025-03-03 18:26:01,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:01,380 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1210 transitions. [2025-03-03 18:26:01,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:01,380 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1210 transitions. [2025-03-03 18:26:01,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-03 18:26:01,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:01,383 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:01,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 18:26:01,383 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:01,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:01,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1307191423, now seen corresponding path program 1 times [2025-03-03 18:26:01,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:01,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330337394] [2025-03-03 18:26:01,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:01,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:01,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-03 18:26:01,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-03 18:26:01,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:01,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:02,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:02,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:02,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330337394] [2025-03-03 18:26:02,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330337394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:02,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:02,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:26:02,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42477495] [2025-03-03 18:26:02,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:02,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:26:02,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:02,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:26:02,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:26:02,036 INFO L87 Difference]: Start difference. First operand 811 states and 1210 transitions. Second operand has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 18:26:02,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:02,709 INFO L93 Difference]: Finished difference Result 2327 states and 3478 transitions. [2025-03-03 18:26:02,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:26:02,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 292 [2025-03-03 18:26:02,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:02,713 INFO L225 Difference]: With dead ends: 2327 [2025-03-03 18:26:02,713 INFO L226 Difference]: Without dead ends: 811 [2025-03-03 18:26:02,715 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-03 18:26:02,715 INFO L435 NwaCegarLoop]: 1896 mSDtfsCounter, 2043 mSDsluCounter, 2846 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2044 SdHoareTripleChecker+Valid, 4742 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:02,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2044 Valid, 4742 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:26:02,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2025-03-03 18:26:02,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2025-03-03 18:26:02,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 807 states have (on average 1.493184634448575) internal successors, (1205), 807 states have internal predecessors, (1205), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 18:26:02,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1209 transitions. [2025-03-03 18:26:02,730 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1209 transitions. Word has length 292 [2025-03-03 18:26:02,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:02,731 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1209 transitions. [2025-03-03 18:26:02,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 18:26:02,731 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1209 transitions. [2025-03-03 18:26:02,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-03 18:26:02,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:02,734 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:02,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 18:26:02,734 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:02,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:02,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1952361004, now seen corresponding path program 1 times [2025-03-03 18:26:02,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:02,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123309320] [2025-03-03 18:26:02,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:02,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:02,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-03 18:26:02,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-03 18:26:02,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:02,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:03,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:03,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:03,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123309320] [2025-03-03 18:26:03,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123309320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:03,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:03,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:26:03,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352397477] [2025-03-03 18:26:03,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:03,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:26:03,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:03,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:26:03,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:26:03,283 INFO L87 Difference]: Start difference. First operand 811 states and 1209 transitions. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:03,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:03,674 INFO L93 Difference]: Finished difference Result 1586 states and 2365 transitions. [2025-03-03 18:26:03,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:26:03,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 293 [2025-03-03 18:26:03,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:03,678 INFO L225 Difference]: With dead ends: 1586 [2025-03-03 18:26:03,678 INFO L226 Difference]: Without dead ends: 813 [2025-03-03 18:26:03,679 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-03 18:26:03,680 INFO L435 NwaCegarLoop]: 1009 mSDtfsCounter, 0 mSDsluCounter, 2010 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3019 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:03,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3019 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:26:03,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2025-03-03 18:26:03,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2025-03-03 18:26:03,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 809 states have (on average 1.491965389369592) internal successors, (1207), 809 states have internal predecessors, (1207), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 18:26:03,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1211 transitions. [2025-03-03 18:26:03,699 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1211 transitions. Word has length 293 [2025-03-03 18:26:03,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:03,699 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1211 transitions. [2025-03-03 18:26:03,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:03,700 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1211 transitions. [2025-03-03 18:26:03,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-03 18:26:03,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:03,702 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:03,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 18:26:03,703 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:03,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:03,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1537860669, now seen corresponding path program 1 times [2025-03-03 18:26:03,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:03,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063998651] [2025-03-03 18:26:03,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:03,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:03,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-03 18:26:03,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-03 18:26:03,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:03,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:04,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:04,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:04,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063998651] [2025-03-03 18:26:04,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063998651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:04,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:04,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:26:04,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108581298] [2025-03-03 18:26:04,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:04,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:26:04,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:04,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:26:04,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:26:04,255 INFO L87 Difference]: Start difference. First operand 813 states and 1211 transitions. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:04,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:04,594 INFO L93 Difference]: Finished difference Result 1588 states and 2366 transitions. [2025-03-03 18:26:04,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:26:04,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 294 [2025-03-03 18:26:04,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:04,597 INFO L225 Difference]: With dead ends: 1588 [2025-03-03 18:26:04,597 INFO L226 Difference]: Without dead ends: 813 [2025-03-03 18:26:04,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:26:04,599 INFO L435 NwaCegarLoop]: 998 mSDtfsCounter, 1162 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:04,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 1998 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:26:04,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2025-03-03 18:26:04,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2025-03-03 18:26:04,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 809 states have (on average 1.4907292954264524) internal successors, (1206), 809 states have internal predecessors, (1206), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 18:26:04,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1210 transitions. [2025-03-03 18:26:04,612 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1210 transitions. Word has length 294 [2025-03-03 18:26:04,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:04,612 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1210 transitions. [2025-03-03 18:26:04,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:04,613 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1210 transitions. [2025-03-03 18:26:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-03 18:26:04,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:04,615 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:04,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 18:26:04,615 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:04,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:04,616 INFO L85 PathProgramCache]: Analyzing trace with hash 585000132, now seen corresponding path program 1 times [2025-03-03 18:26:04,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:04,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136906743] [2025-03-03 18:26:04,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:04,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:04,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-03 18:26:04,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-03 18:26:04,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:04,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:05,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:05,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:05,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136906743] [2025-03-03 18:26:05,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136906743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:05,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:05,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:26:05,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330217300] [2025-03-03 18:26:05,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:05,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:26:05,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:05,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:26:05,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:26:05,080 INFO L87 Difference]: Start difference. First operand 813 states and 1210 transitions. Second operand has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:05,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:05,443 INFO L93 Difference]: Finished difference Result 1588 states and 2364 transitions. [2025-03-03 18:26:05,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:26:05,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 295 [2025-03-03 18:26:05,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:05,447 INFO L225 Difference]: With dead ends: 1588 [2025-03-03 18:26:05,447 INFO L226 Difference]: Without dead ends: 813 [2025-03-03 18:26:05,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:26:05,449 INFO L435 NwaCegarLoop]: 998 mSDtfsCounter, 1160 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:05,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 1998 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:26:05,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2025-03-03 18:26:05,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2025-03-03 18:26:05,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 809 states have (on average 1.4894932014833127) internal successors, (1205), 809 states have internal predecessors, (1205), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 18:26:05,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1209 transitions. [2025-03-03 18:26:05,463 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1209 transitions. Word has length 295 [2025-03-03 18:26:05,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:05,464 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1209 transitions. [2025-03-03 18:26:05,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.0) internal successors, (288), 4 states have internal predecessors, (288), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:05,464 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1209 transitions. [2025-03-03 18:26:05,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-03 18:26:05,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:05,467 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:05,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 18:26:05,467 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:05,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:05,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1350903267, now seen corresponding path program 1 times [2025-03-03 18:26:05,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:05,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534556824] [2025-03-03 18:26:05,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:05,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:05,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-03 18:26:05,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-03 18:26:05,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:05,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:06,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:06,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:06,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534556824] [2025-03-03 18:26:06,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534556824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:06,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:06,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:26:06,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960057001] [2025-03-03 18:26:06,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:06,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:26:06,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:06,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:26:06,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:26:06,082 INFO L87 Difference]: Start difference. First operand 813 states and 1209 transitions. Second operand has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:06,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:06,671 INFO L93 Difference]: Finished difference Result 2239 states and 3332 transitions. [2025-03-03 18:26:06,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:26:06,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 296 [2025-03-03 18:26:06,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:06,676 INFO L225 Difference]: With dead ends: 2239 [2025-03-03 18:26:06,676 INFO L226 Difference]: Without dead ends: 1464 [2025-03-03 18:26:06,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:26:06,679 INFO L435 NwaCegarLoop]: 996 mSDtfsCounter, 941 mSDsluCounter, 2955 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 3951 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:06,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 3951 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:26:06,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2025-03-03 18:26:06,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 852. [2025-03-03 18:26:06,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 846 states have (on average 1.4846335697399526) internal successors, (1256), 846 states have internal predecessors, (1256), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 18:26:06,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1264 transitions. [2025-03-03 18:26:06,723 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1264 transitions. Word has length 296 [2025-03-03 18:26:06,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:06,723 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 1264 transitions. [2025-03-03 18:26:06,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 5 states have internal predecessors, (289), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:06,724 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1264 transitions. [2025-03-03 18:26:06,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-03 18:26:06,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:06,727 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:06,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 18:26:06,727 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:06,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:06,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1223175161, now seen corresponding path program 1 times [2025-03-03 18:26:06,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:06,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086371472] [2025-03-03 18:26:06,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:06,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:06,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-03 18:26:06,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-03 18:26:06,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:06,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:07,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:07,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086371472] [2025-03-03 18:26:07,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086371472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:07,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:07,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:26:07,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372602512] [2025-03-03 18:26:07,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:07,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:26:07,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:07,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:26:07,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:26:07,039 INFO L87 Difference]: Start difference. First operand 852 states and 1264 transitions. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:07,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:07,333 INFO L93 Difference]: Finished difference Result 1666 states and 2472 transitions. [2025-03-03 18:26:07,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:26:07,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 297 [2025-03-03 18:26:07,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:07,336 INFO L225 Difference]: With dead ends: 1666 [2025-03-03 18:26:07,336 INFO L226 Difference]: Without dead ends: 852 [2025-03-03 18:26:07,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:26:07,337 INFO L435 NwaCegarLoop]: 1003 mSDtfsCounter, 1155 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:07,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 2010 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:26:07,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2025-03-03 18:26:07,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 852. [2025-03-03 18:26:07,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 846 states have (on average 1.483451536643026) internal successors, (1255), 846 states have internal predecessors, (1255), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 18:26:07,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1263 transitions. [2025-03-03 18:26:07,352 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1263 transitions. Word has length 297 [2025-03-03 18:26:07,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:07,352 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 1263 transitions. [2025-03-03 18:26:07,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:07,352 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1263 transitions. [2025-03-03 18:26:07,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-03 18:26:07,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:07,355 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:07,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 18:26:07,355 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:07,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:07,356 INFO L85 PathProgramCache]: Analyzing trace with hash -507625932, now seen corresponding path program 1 times [2025-03-03 18:26:07,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:07,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144598832] [2025-03-03 18:26:07,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:07,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:07,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-03 18:26:07,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-03 18:26:07,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:07,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:07,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:07,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144598832] [2025-03-03 18:26:07,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144598832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:07,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:07,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:26:07,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410011673] [2025-03-03 18:26:07,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:07,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:26:07,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:07,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:26:07,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:26:07,771 INFO L87 Difference]: Start difference. First operand 852 states and 1263 transitions. Second operand has 6 states, 6 states have (on average 48.333333333333336) internal successors, (290), 6 states have internal predecessors, (290), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:08,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:08,615 INFO L93 Difference]: Finished difference Result 2317 states and 3439 transitions. [2025-03-03 18:26:08,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:26:08,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 48.333333333333336) internal successors, (290), 6 states have internal predecessors, (290), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 297 [2025-03-03 18:26:08,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:08,620 INFO L225 Difference]: With dead ends: 2317 [2025-03-03 18:26:08,620 INFO L226 Difference]: Without dead ends: 1503 [2025-03-03 18:26:08,621 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-03 18:26:08,623 INFO L435 NwaCegarLoop]: 1796 mSDtfsCounter, 710 mSDsluCounter, 5566 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 7362 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:08,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 7362 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 18:26:08,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2025-03-03 18:26:08,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1355. [2025-03-03 18:26:08,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 1347 states have (on average 1.4855233853006682) internal successors, (2001), 1347 states have internal predecessors, (2001), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 18:26:08,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 2013 transitions. [2025-03-03 18:26:08,648 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 2013 transitions. Word has length 297 [2025-03-03 18:26:08,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:08,649 INFO L471 AbstractCegarLoop]: Abstraction has 1355 states and 2013 transitions. [2025-03-03 18:26:08,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.333333333333336) internal successors, (290), 6 states have internal predecessors, (290), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:08,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 2013 transitions. [2025-03-03 18:26:08,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-03 18:26:08,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:08,652 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:08,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 18:26:08,652 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:08,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:08,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1927717299, now seen corresponding path program 1 times [2025-03-03 18:26:08,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:08,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527149781] [2025-03-03 18:26:08,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:08,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:08,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-03 18:26:08,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-03 18:26:08,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:08,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:09,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:09,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:09,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527149781] [2025-03-03 18:26:09,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527149781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:09,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:09,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:26:09,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718291335] [2025-03-03 18:26:09,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:09,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:26:09,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:09,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:26:09,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:26:09,510 INFO L87 Difference]: Start difference. First operand 1355 states and 2013 transitions. Second operand has 7 states, 7 states have (on average 41.57142857142857) internal successors, (291), 7 states have internal predecessors, (291), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:10,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:10,300 INFO L93 Difference]: Finished difference Result 3284 states and 4883 transitions. [2025-03-03 18:26:10,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:26:10,300 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 41.57142857142857) internal successors, (291), 7 states have internal predecessors, (291), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 298 [2025-03-03 18:26:10,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:10,306 INFO L225 Difference]: With dead ends: 3284 [2025-03-03 18:26:10,306 INFO L226 Difference]: Without dead ends: 1967 [2025-03-03 18:26:10,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:26:10,309 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 1246 mSDsluCounter, 4149 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 5120 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:10,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 5120 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1229 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:26:10,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2025-03-03 18:26:10,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1403. [2025-03-03 18:26:10,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1403 states, 1395 states have (on average 1.4845878136200716) internal successors, (2071), 1395 states have internal predecessors, (2071), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 18:26:10,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 2083 transitions. [2025-03-03 18:26:10,341 INFO L78 Accepts]: Start accepts. Automaton has 1403 states and 2083 transitions. Word has length 298 [2025-03-03 18:26:10,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:10,342 INFO L471 AbstractCegarLoop]: Abstraction has 1403 states and 2083 transitions. [2025-03-03 18:26:10,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 41.57142857142857) internal successors, (291), 7 states have internal predecessors, (291), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:10,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 2083 transitions. [2025-03-03 18:26:10,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-03 18:26:10,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:10,345 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:10,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 18:26:10,346 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:10,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:10,346 INFO L85 PathProgramCache]: Analyzing trace with hash -262074492, now seen corresponding path program 1 times [2025-03-03 18:26:10,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:10,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194898626] [2025-03-03 18:26:10,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:10,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:10,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-03 18:26:10,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-03 18:26:10,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:10,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:11,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:11,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:11,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194898626] [2025-03-03 18:26:11,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194898626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:11,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:11,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:26:11,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515775345] [2025-03-03 18:26:11,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:11,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:26:11,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:11,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:26:11,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:26:11,005 INFO L87 Difference]: Start difference. First operand 1403 states and 2083 transitions. Second operand has 7 states, 7 states have (on average 41.57142857142857) internal successors, (291), 7 states have internal predecessors, (291), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:11,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:11,886 INFO L93 Difference]: Finished difference Result 2919 states and 4333 transitions. [2025-03-03 18:26:11,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:26:11,887 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 41.57142857142857) internal successors, (291), 7 states have internal predecessors, (291), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 298 [2025-03-03 18:26:11,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:11,893 INFO L225 Difference]: With dead ends: 2919 [2025-03-03 18:26:11,893 INFO L226 Difference]: Without dead ends: 1554 [2025-03-03 18:26:11,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:26:11,895 INFO L435 NwaCegarLoop]: 1799 mSDtfsCounter, 927 mSDsluCounter, 6359 mSDsCounter, 0 mSdLazyCounter, 1717 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 8158 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:11,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 8158 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 18:26:11,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2025-03-03 18:26:11,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1406. [2025-03-03 18:26:11,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1398 states have (on average 1.4835479256080115) internal successors, (2074), 1398 states have internal predecessors, (2074), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 18:26:11,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 2086 transitions. [2025-03-03 18:26:11,932 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 2086 transitions. Word has length 298 [2025-03-03 18:26:11,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:11,932 INFO L471 AbstractCegarLoop]: Abstraction has 1406 states and 2086 transitions. [2025-03-03 18:26:11,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 41.57142857142857) internal successors, (291), 7 states have internal predecessors, (291), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:11,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 2086 transitions. [2025-03-03 18:26:11,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-03 18:26:11,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:11,935 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:11,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 18:26:11,935 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:11,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:11,936 INFO L85 PathProgramCache]: Analyzing trace with hash -2019737643, now seen corresponding path program 1 times [2025-03-03 18:26:11,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:11,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844592140] [2025-03-03 18:26:11,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:11,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:11,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-03 18:26:12,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-03 18:26:12,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:12,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:12,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:12,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:12,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844592140] [2025-03-03 18:26:12,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844592140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:12,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:12,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:26:12,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335957976] [2025-03-03 18:26:12,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:12,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:26:12,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:12,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:26:12,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:26:12,602 INFO L87 Difference]: Start difference. First operand 1406 states and 2086 transitions. Second operand has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:13,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:13,103 INFO L93 Difference]: Finished difference Result 2774 states and 4116 transitions. [2025-03-03 18:26:13,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:26:13,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 298 [2025-03-03 18:26:13,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:13,108 INFO L225 Difference]: With dead ends: 2774 [2025-03-03 18:26:13,108 INFO L226 Difference]: Without dead ends: 1406 [2025-03-03 18:26:13,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:26:13,110 INFO L435 NwaCegarLoop]: 936 mSDtfsCounter, 1151 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 2973 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:13,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 2973 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:26:13,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2025-03-03 18:26:13,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1406. [2025-03-03 18:26:13,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1398 states have (on average 1.4821173104434906) internal successors, (2072), 1398 states have internal predecessors, (2072), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 18:26:13,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 2084 transitions. [2025-03-03 18:26:13,135 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 2084 transitions. Word has length 298 [2025-03-03 18:26:13,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:13,136 INFO L471 AbstractCegarLoop]: Abstraction has 1406 states and 2084 transitions. [2025-03-03 18:26:13,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:13,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 2084 transitions. [2025-03-03 18:26:13,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-03-03 18:26:13,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:13,138 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:13,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 18:26:13,139 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:13,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:13,139 INFO L85 PathProgramCache]: Analyzing trace with hash -438937453, now seen corresponding path program 1 times [2025-03-03 18:26:13,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:13,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228232886] [2025-03-03 18:26:13,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:13,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:13,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-03 18:26:13,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-03 18:26:13,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:13,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:13,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:13,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:13,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228232886] [2025-03-03 18:26:13,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228232886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:13,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:13,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:26:13,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999867021] [2025-03-03 18:26:13,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:13,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:26:13,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:13,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:26:13,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:26:13,755 INFO L87 Difference]: Start difference. First operand 1406 states and 2084 transitions. Second operand has 6 states, 6 states have (on average 48.666666666666664) internal successors, (292), 6 states have internal predecessors, (292), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:14,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:14,417 INFO L93 Difference]: Finished difference Result 3338 states and 4954 transitions. [2025-03-03 18:26:14,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:26:14,418 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 48.666666666666664) internal successors, (292), 6 states have internal predecessors, (292), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 299 [2025-03-03 18:26:14,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:14,422 INFO L225 Difference]: With dead ends: 3338 [2025-03-03 18:26:14,422 INFO L226 Difference]: Without dead ends: 1970 [2025-03-03 18:26:14,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:26:14,425 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 1239 mSDsluCounter, 3902 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1239 SdHoareTripleChecker+Valid, 4873 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:14,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1239 Valid, 4873 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:26:14,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2025-03-03 18:26:14,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1414. [2025-03-03 18:26:14,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1414 states, 1406 states have (on average 1.4815078236130867) internal successors, (2083), 1406 states have internal predecessors, (2083), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 18:26:14,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 2095 transitions. [2025-03-03 18:26:14,451 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 2095 transitions. Word has length 299 [2025-03-03 18:26:14,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:14,451 INFO L471 AbstractCegarLoop]: Abstraction has 1414 states and 2095 transitions. [2025-03-03 18:26:14,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.666666666666664) internal successors, (292), 6 states have internal predecessors, (292), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:14,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2095 transitions. [2025-03-03 18:26:14,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-03 18:26:14,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:14,453 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:14,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 18:26:14,453 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:14,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:14,454 INFO L85 PathProgramCache]: Analyzing trace with hash 318071171, now seen corresponding path program 1 times [2025-03-03 18:26:14,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:14,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887153688] [2025-03-03 18:26:14,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:14,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:14,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-03 18:26:14,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-03 18:26:14,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:14,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:15,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:15,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:15,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887153688] [2025-03-03 18:26:15,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887153688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:15,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:15,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:26:15,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201382899] [2025-03-03 18:26:15,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:15,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:26:15,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:15,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:26:15,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:26:15,322 INFO L87 Difference]: Start difference. First operand 1414 states and 2095 transitions. Second operand has 10 states, 10 states have (on average 29.3) internal successors, (293), 10 states have internal predecessors, (293), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:16,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:16,352 INFO L93 Difference]: Finished difference Result 3350 states and 4970 transitions. [2025-03-03 18:26:16,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 18:26:16,352 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 29.3) internal successors, (293), 10 states have internal predecessors, (293), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 300 [2025-03-03 18:26:16,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:16,357 INFO L225 Difference]: With dead ends: 3350 [2025-03-03 18:26:16,357 INFO L226 Difference]: Without dead ends: 1974 [2025-03-03 18:26:16,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-03 18:26:16,358 INFO L435 NwaCegarLoop]: 961 mSDtfsCounter, 3341 mSDsluCounter, 6705 mSDsCounter, 0 mSdLazyCounter, 1933 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3343 SdHoareTripleChecker+Valid, 7666 SdHoareTripleChecker+Invalid, 1933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:16,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3343 Valid, 7666 Invalid, 1933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1933 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 18:26:16,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2025-03-03 18:26:16,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1416. [2025-03-03 18:26:16,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 1408 states have (on average 1.4808238636363635) internal successors, (2085), 1408 states have internal predecessors, (2085), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 18:26:16,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2097 transitions. [2025-03-03 18:26:16,378 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2097 transitions. Word has length 300 [2025-03-03 18:26:16,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:16,379 INFO L471 AbstractCegarLoop]: Abstraction has 1416 states and 2097 transitions. [2025-03-03 18:26:16,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 29.3) internal successors, (293), 10 states have internal predecessors, (293), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:16,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2097 transitions. [2025-03-03 18:26:16,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-03 18:26:16,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:16,381 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:16,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 18:26:16,381 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:16,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:16,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1586676671, now seen corresponding path program 1 times [2025-03-03 18:26:16,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:16,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560637730] [2025-03-03 18:26:16,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:16,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:16,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-03 18:26:16,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-03 18:26:16,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:16,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:16,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:16,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560637730] [2025-03-03 18:26:16,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560637730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:16,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:16,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:26:16,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288036886] [2025-03-03 18:26:16,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:16,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:26:16,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:16,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:26:16,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:26:16,782 INFO L87 Difference]: Start difference. First operand 1416 states and 2097 transitions. Second operand has 5 states, 5 states have (on average 58.6) internal successors, (293), 5 states have internal predecessors, (293), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:17,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:17,199 INFO L93 Difference]: Finished difference Result 3507 states and 5188 transitions. [2025-03-03 18:26:17,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:26:17,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 58.6) internal successors, (293), 5 states have internal predecessors, (293), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 300 [2025-03-03 18:26:17,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:17,204 INFO L225 Difference]: With dead ends: 3507 [2025-03-03 18:26:17,205 INFO L226 Difference]: Without dead ends: 2129 [2025-03-03 18:26:17,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:26:17,206 INFO L435 NwaCegarLoop]: 1003 mSDtfsCounter, 319 mSDsluCounter, 3001 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 4004 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:17,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 4004 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:26:17,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2025-03-03 18:26:17,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 2083. [2025-03-03 18:26:17,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2083 states, 2069 states have (on average 1.4755920734654422) internal successors, (3053), 2069 states have internal predecessors, (3053), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 18:26:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 3077 transitions. [2025-03-03 18:26:17,234 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 3077 transitions. Word has length 300 [2025-03-03 18:26:17,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:17,234 INFO L471 AbstractCegarLoop]: Abstraction has 2083 states and 3077 transitions. [2025-03-03 18:26:17,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.6) internal successors, (293), 5 states have internal predecessors, (293), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:17,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 3077 transitions. [2025-03-03 18:26:17,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-03 18:26:17,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:17,243 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:17,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 18:26:17,244 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:17,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:17,244 INFO L85 PathProgramCache]: Analyzing trace with hash 802532704, now seen corresponding path program 1 times [2025-03-03 18:26:17,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:17,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147932288] [2025-03-03 18:26:17,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:17,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:17,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-03 18:26:17,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-03 18:26:17,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:17,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:17,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:17,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:17,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147932288] [2025-03-03 18:26:17,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147932288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:17,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:17,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:26:17,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619750091] [2025-03-03 18:26:17,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:17,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:26:17,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:17,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:26:17,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:26:17,494 INFO L87 Difference]: Start difference. First operand 2083 states and 3077 transitions. Second operand has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:17,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:17,772 INFO L93 Difference]: Finished difference Result 3461 states and 5118 transitions. [2025-03-03 18:26:17,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:26:17,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 301 [2025-03-03 18:26:17,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:17,779 INFO L225 Difference]: With dead ends: 3461 [2025-03-03 18:26:17,779 INFO L226 Difference]: Without dead ends: 2083 [2025-03-03 18:26:17,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:26:17,782 INFO L435 NwaCegarLoop]: 1002 mSDtfsCounter, 1035 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 2008 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:17,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 2008 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:26:17,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2025-03-03 18:26:17,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 2083. [2025-03-03 18:26:17,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2083 states, 2069 states have (on average 1.474625422909618) internal successors, (3051), 2069 states have internal predecessors, (3051), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 18:26:17,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 3075 transitions. [2025-03-03 18:26:17,823 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 3075 transitions. Word has length 301 [2025-03-03 18:26:17,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:17,824 INFO L471 AbstractCegarLoop]: Abstraction has 2083 states and 3075 transitions. [2025-03-03 18:26:17,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:17,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 3075 transitions. [2025-03-03 18:26:17,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-03 18:26:17,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:17,830 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:17,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 18:26:17,830 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:17,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:17,831 INFO L85 PathProgramCache]: Analyzing trace with hash 2143198773, now seen corresponding path program 1 times [2025-03-03 18:26:17,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:17,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216502526] [2025-03-03 18:26:17,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:17,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:17,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-03 18:26:18,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-03 18:26:18,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:18,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:18,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:18,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:18,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216502526] [2025-03-03 18:26:18,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216502526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:18,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:18,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 18:26:18,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955860531] [2025-03-03 18:26:18,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:18,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:26:18,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:18,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:26:18,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:26:18,734 INFO L87 Difference]: Start difference. First operand 2083 states and 3075 transitions. Second operand has 8 states, 8 states have (on average 36.75) internal successors, (294), 8 states have internal predecessors, (294), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:19,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:19,295 INFO L93 Difference]: Finished difference Result 3475 states and 5134 transitions. [2025-03-03 18:26:19,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:26:19,295 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 36.75) internal successors, (294), 8 states have internal predecessors, (294), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 301 [2025-03-03 18:26:19,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:19,300 INFO L225 Difference]: With dead ends: 3475 [2025-03-03 18:26:19,300 INFO L226 Difference]: Without dead ends: 2097 [2025-03-03 18:26:19,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:26:19,303 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 1858 mSDsluCounter, 3721 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1858 SdHoareTripleChecker+Valid, 4661 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:19,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1858 Valid, 4661 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:26:19,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2097 states. [2025-03-03 18:26:19,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2097 to 2095. [2025-03-03 18:26:19,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2095 states, 2081 states have (on average 1.4738106679481018) internal successors, (3067), 2081 states have internal predecessors, (3067), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 18:26:19,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 2095 states and 3091 transitions. [2025-03-03 18:26:19,326 INFO L78 Accepts]: Start accepts. Automaton has 2095 states and 3091 transitions. Word has length 301 [2025-03-03 18:26:19,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:19,327 INFO L471 AbstractCegarLoop]: Abstraction has 2095 states and 3091 transitions. [2025-03-03 18:26:19,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 36.75) internal successors, (294), 8 states have internal predecessors, (294), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:19,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 3091 transitions. [2025-03-03 18:26:19,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-03 18:26:19,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:19,330 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:19,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 18:26:19,330 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:19,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:19,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1522329966, now seen corresponding path program 1 times [2025-03-03 18:26:19,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:19,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867632532] [2025-03-03 18:26:19,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:19,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:19,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-03 18:26:19,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-03 18:26:19,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:19,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:19,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:19,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:19,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867632532] [2025-03-03 18:26:19,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867632532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:19,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:19,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:26:19,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993649797] [2025-03-03 18:26:19,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:19,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:26:19,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:19,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:26:19,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:26:19,733 INFO L87 Difference]: Start difference. First operand 2095 states and 3091 transitions. Second operand has 7 states, 7 states have (on average 42.142857142857146) internal successors, (295), 7 states have internal predecessors, (295), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:20,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:20,061 INFO L93 Difference]: Finished difference Result 3487 states and 5150 transitions. [2025-03-03 18:26:20,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:26:20,063 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 42.142857142857146) internal successors, (295), 7 states have internal predecessors, (295), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 302 [2025-03-03 18:26:20,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:20,068 INFO L225 Difference]: With dead ends: 3487 [2025-03-03 18:26:20,068 INFO L226 Difference]: Without dead ends: 2097 [2025-03-03 18:26:20,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:26:20,070 INFO L435 NwaCegarLoop]: 999 mSDtfsCounter, 924 mSDsluCounter, 2993 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 3992 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:20,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 3992 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:26:20,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2097 states. [2025-03-03 18:26:20,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2097 to 2097. [2025-03-03 18:26:20,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2097 states, 2083 states have (on average 1.4723955832933269) internal successors, (3067), 2083 states have internal predecessors, (3067), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 18:26:20,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 3091 transitions. [2025-03-03 18:26:20,108 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 3091 transitions. Word has length 302 [2025-03-03 18:26:20,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:20,108 INFO L471 AbstractCegarLoop]: Abstraction has 2097 states and 3091 transitions. [2025-03-03 18:26:20,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 42.142857142857146) internal successors, (295), 7 states have internal predecessors, (295), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:20,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 3091 transitions. [2025-03-03 18:26:20,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-03 18:26:20,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:20,112 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:20,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 18:26:20,112 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:20,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:20,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1794792584, now seen corresponding path program 1 times [2025-03-03 18:26:20,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:20,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661103401] [2025-03-03 18:26:20,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:20,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:20,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-03 18:26:20,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-03 18:26:20,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:20,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:21,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:21,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:21,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661103401] [2025-03-03 18:26:21,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661103401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:21,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:21,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:26:21,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650095211] [2025-03-03 18:26:21,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:21,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:26:21,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:21,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:26:21,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:26:21,096 INFO L87 Difference]: Start difference. First operand 2097 states and 3091 transitions. Second operand has 7 states, 7 states have (on average 42.142857142857146) internal successors, (295), 7 states have internal predecessors, (295), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:21,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:21,752 INFO L93 Difference]: Finished difference Result 4208 states and 6204 transitions. [2025-03-03 18:26:21,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:26:21,752 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 42.142857142857146) internal successors, (295), 7 states have internal predecessors, (295), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 302 [2025-03-03 18:26:21,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:21,757 INFO L225 Difference]: With dead ends: 4208 [2025-03-03 18:26:21,757 INFO L226 Difference]: Without dead ends: 2816 [2025-03-03 18:26:21,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:26:21,759 INFO L435 NwaCegarLoop]: 1309 mSDtfsCounter, 1500 mSDsluCounter, 3899 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 5208 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:21,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1502 Valid, 5208 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1493 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:26:21,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2816 states. [2025-03-03 18:26:21,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2816 to 2794. [2025-03-03 18:26:21,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2794 states, 2774 states have (on average 1.469718817591925) internal successors, (4077), 2774 states have internal predecessors, (4077), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 18:26:21,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2794 states to 2794 states and 4113 transitions. [2025-03-03 18:26:21,786 INFO L78 Accepts]: Start accepts. Automaton has 2794 states and 4113 transitions. Word has length 302 [2025-03-03 18:26:21,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:21,787 INFO L471 AbstractCegarLoop]: Abstraction has 2794 states and 4113 transitions. [2025-03-03 18:26:21,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 42.142857142857146) internal successors, (295), 7 states have internal predecessors, (295), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:21,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2794 states and 4113 transitions. [2025-03-03 18:26:21,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-03-03 18:26:21,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:21,791 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:21,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 18:26:21,791 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:21,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:21,792 INFO L85 PathProgramCache]: Analyzing trace with hash 881953433, now seen corresponding path program 1 times [2025-03-03 18:26:21,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:21,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531168169] [2025-03-03 18:26:21,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:21,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:21,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-03 18:26:21,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-03 18:26:21,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:21,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:22,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:22,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:22,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531168169] [2025-03-03 18:26:22,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531168169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:22,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:22,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:26:22,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171075939] [2025-03-03 18:26:22,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:22,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:26:22,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:22,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:26:22,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:26:22,192 INFO L87 Difference]: Start difference. First operand 2794 states and 4113 transitions. Second operand has 6 states, 6 states have (on average 49.333333333333336) internal successors, (296), 6 states have internal predecessors, (296), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:22,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:22,736 INFO L93 Difference]: Finished difference Result 4616 states and 6810 transitions. [2025-03-03 18:26:22,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:26:22,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 49.333333333333336) internal successors, (296), 6 states have internal predecessors, (296), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 303 [2025-03-03 18:26:22,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:22,742 INFO L225 Difference]: With dead ends: 4616 [2025-03-03 18:26:22,742 INFO L226 Difference]: Without dead ends: 3224 [2025-03-03 18:26:22,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:26:22,744 INFO L435 NwaCegarLoop]: 976 mSDtfsCounter, 632 mSDsluCounter, 3899 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 4875 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:22,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 4875 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:26:22,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3224 states. [2025-03-03 18:26:22,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3224 to 2810. [2025-03-03 18:26:22,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2810 states, 2790 states have (on average 1.4684587813620071) internal successors, (4097), 2790 states have internal predecessors, (4097), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 18:26:22,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 4133 transitions. [2025-03-03 18:26:22,776 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 4133 transitions. Word has length 303 [2025-03-03 18:26:22,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:22,776 INFO L471 AbstractCegarLoop]: Abstraction has 2810 states and 4133 transitions. [2025-03-03 18:26:22,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.333333333333336) internal successors, (296), 6 states have internal predecessors, (296), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:22,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 4133 transitions. [2025-03-03 18:26:22,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-03-03 18:26:22,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:22,780 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:22,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 18:26:22,780 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:22,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:22,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1814552258, now seen corresponding path program 1 times [2025-03-03 18:26:22,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:22,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944464111] [2025-03-03 18:26:22,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:22,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:22,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-03 18:26:22,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-03 18:26:22,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:22,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:23,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:23,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:23,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944464111] [2025-03-03 18:26:23,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944464111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:23,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:23,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:26:23,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598629150] [2025-03-03 18:26:23,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:23,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:26:23,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:23,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:26:23,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:26:23,408 INFO L87 Difference]: Start difference. First operand 2810 states and 4133 transitions. Second operand has 6 states, 6 states have (on average 49.333333333333336) internal successors, (296), 6 states have internal predecessors, (296), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:24,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:24,076 INFO L93 Difference]: Finished difference Result 4250 states and 6256 transitions. [2025-03-03 18:26:24,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:26:24,077 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 49.333333333333336) internal successors, (296), 6 states have internal predecessors, (296), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 303 [2025-03-03 18:26:24,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:24,081 INFO L225 Difference]: With dead ends: 4250 [2025-03-03 18:26:24,081 INFO L226 Difference]: Without dead ends: 2832 [2025-03-03 18:26:24,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:26:24,083 INFO L435 NwaCegarLoop]: 1312 mSDtfsCounter, 1505 mSDsluCounter, 3522 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 4834 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:24,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 4834 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:26:24,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2832 states. [2025-03-03 18:26:24,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2832 to 2810. [2025-03-03 18:26:24,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2810 states, 2790 states have (on average 1.467741935483871) internal successors, (4095), 2790 states have internal predecessors, (4095), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 18:26:24,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 4131 transitions. [2025-03-03 18:26:24,114 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 4131 transitions. Word has length 303 [2025-03-03 18:26:24,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:24,115 INFO L471 AbstractCegarLoop]: Abstraction has 2810 states and 4131 transitions. [2025-03-03 18:26:24,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.333333333333336) internal successors, (296), 6 states have internal predecessors, (296), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:24,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 4131 transitions. [2025-03-03 18:26:24,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-03-03 18:26:24,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:24,118 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:24,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 18:26:24,119 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:24,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:24,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1397511012, now seen corresponding path program 1 times [2025-03-03 18:26:24,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:24,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055763486] [2025-03-03 18:26:24,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:24,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:24,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-03 18:26:24,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-03 18:26:24,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:24,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:24,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:24,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:24,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055763486] [2025-03-03 18:26:24,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055763486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:24,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:24,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:26:24,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724517968] [2025-03-03 18:26:24,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:24,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:26:24,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:24,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:26:24,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:26:24,814 INFO L87 Difference]: Start difference. First operand 2810 states and 4131 transitions. Second operand has 10 states, 10 states have (on average 29.6) internal successors, (296), 10 states have internal predecessors, (296), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 18:26:25,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:25,653 INFO L93 Difference]: Finished difference Result 7380 states and 10870 transitions. [2025-03-03 18:26:25,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 18:26:25,653 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 29.6) internal successors, (296), 10 states have internal predecessors, (296), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 303 [2025-03-03 18:26:25,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:25,660 INFO L225 Difference]: With dead ends: 7380 [2025-03-03 18:26:25,660 INFO L226 Difference]: Without dead ends: 5230 [2025-03-03 18:26:25,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-03 18:26:25,663 INFO L435 NwaCegarLoop]: 935 mSDtfsCounter, 3317 mSDsluCounter, 5734 mSDsCounter, 0 mSdLazyCounter, 1989 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3318 SdHoareTripleChecker+Valid, 6669 SdHoareTripleChecker+Invalid, 1992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:25,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3318 Valid, 6669 Invalid, 1992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1989 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:26:25,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5230 states. [2025-03-03 18:26:25,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5230 to 3233. [2025-03-03 18:26:25,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3233 states, 3207 states have (on average 1.461178671655753) internal successors, (4686), 3207 states have internal predecessors, (4686), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 18:26:25,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3233 states to 3233 states and 4734 transitions. [2025-03-03 18:26:25,696 INFO L78 Accepts]: Start accepts. Automaton has 3233 states and 4734 transitions. Word has length 303 [2025-03-03 18:26:25,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:25,696 INFO L471 AbstractCegarLoop]: Abstraction has 3233 states and 4734 transitions. [2025-03-03 18:26:25,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 29.6) internal successors, (296), 10 states have internal predecessors, (296), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 18:26:25,696 INFO L276 IsEmpty]: Start isEmpty. Operand 3233 states and 4734 transitions. [2025-03-03 18:26:25,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-03 18:26:25,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:25,700 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:25,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 18:26:25,700 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:25,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:25,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1817787484, now seen corresponding path program 1 times [2025-03-03 18:26:25,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:25,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580315535] [2025-03-03 18:26:25,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:25,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:25,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-03 18:26:25,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-03 18:26:25,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:25,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:26,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:26,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:26,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580315535] [2025-03-03 18:26:26,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580315535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:26,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:26,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:26:26,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203785088] [2025-03-03 18:26:26,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:26,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:26:26,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:26,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:26:26,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:26:26,041 INFO L87 Difference]: Start difference. First operand 3233 states and 4734 transitions. Second operand has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:26,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:26,342 INFO L93 Difference]: Finished difference Result 5581 states and 8190 transitions. [2025-03-03 18:26:26,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:26:26,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 304 [2025-03-03 18:26:26,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:26,347 INFO L225 Difference]: With dead ends: 5581 [2025-03-03 18:26:26,347 INFO L226 Difference]: Without dead ends: 3272 [2025-03-03 18:26:26,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-03 18:26:26,350 INFO L435 NwaCegarLoop]: 1001 mSDtfsCounter, 0 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2997 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:26,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2997 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:26:26,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3272 states. [2025-03-03 18:26:26,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3272 to 3272. [2025-03-03 18:26:26,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3272 states, 3246 states have (on average 1.4574861367837337) internal successors, (4731), 3246 states have internal predecessors, (4731), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 18:26:26,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3272 states to 3272 states and 4779 transitions. [2025-03-03 18:26:26,387 INFO L78 Accepts]: Start accepts. Automaton has 3272 states and 4779 transitions. Word has length 304 [2025-03-03 18:26:26,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:26,388 INFO L471 AbstractCegarLoop]: Abstraction has 3272 states and 4779 transitions. [2025-03-03 18:26:26,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:26,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3272 states and 4779 transitions. [2025-03-03 18:26:26,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-03 18:26:26,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:26,393 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:26,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 18:26:26,393 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:26,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:26,394 INFO L85 PathProgramCache]: Analyzing trace with hash -962311767, now seen corresponding path program 1 times [2025-03-03 18:26:26,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:26,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117118297] [2025-03-03 18:26:26,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:26,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:26,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-03 18:26:26,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-03 18:26:26,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:26,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:26,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:26,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:26,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117118297] [2025-03-03 18:26:26,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117118297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:26,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:26,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:26:26,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642234813] [2025-03-03 18:26:26,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:26,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:26:26,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:26,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:26:26,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:26:26,683 INFO L87 Difference]: Start difference. First operand 3272 states and 4779 transitions. Second operand has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:27,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:27,024 INFO L93 Difference]: Finished difference Result 5574 states and 8168 transitions. [2025-03-03 18:26:27,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:26:27,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 304 [2025-03-03 18:26:27,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:27,029 INFO L225 Difference]: With dead ends: 5574 [2025-03-03 18:26:27,029 INFO L226 Difference]: Without dead ends: 3302 [2025-03-03 18:26:27,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:26:27,031 INFO L435 NwaCegarLoop]: 1000 mSDtfsCounter, 2 mSDsluCounter, 2989 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3989 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:27,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3989 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:26:27,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3302 states. [2025-03-03 18:26:27,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3302 to 3296. [2025-03-03 18:26:27,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3296 states, 3270 states have (on average 1.4559633027522936) internal successors, (4761), 3270 states have internal predecessors, (4761), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 18:26:27,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3296 states to 3296 states and 4809 transitions. [2025-03-03 18:26:27,075 INFO L78 Accepts]: Start accepts. Automaton has 3296 states and 4809 transitions. Word has length 304 [2025-03-03 18:26:27,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:27,075 INFO L471 AbstractCegarLoop]: Abstraction has 3296 states and 4809 transitions. [2025-03-03 18:26:27,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:27,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3296 states and 4809 transitions. [2025-03-03 18:26:27,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-03 18:26:27,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:27,080 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:27,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 18:26:27,081 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:27,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:27,081 INFO L85 PathProgramCache]: Analyzing trace with hash -937707402, now seen corresponding path program 1 times [2025-03-03 18:26:27,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:27,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489130329] [2025-03-03 18:26:27,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:27,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:27,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-03 18:26:27,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-03 18:26:27,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:27,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:28,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:28,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:28,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489130329] [2025-03-03 18:26:28,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489130329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:28,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:28,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 18:26:28,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30803481] [2025-03-03 18:26:28,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:28,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 18:26:28,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:28,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 18:26:28,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:26:28,099 INFO L87 Difference]: Start difference. First operand 3296 states and 4809 transitions. Second operand has 12 states, 12 states have (on average 24.75) internal successors, (297), 12 states have internal predecessors, (297), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 18:26:29,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:29,293 INFO L93 Difference]: Finished difference Result 7658 states and 11231 transitions. [2025-03-03 18:26:29,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 18:26:29,294 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 24.75) internal successors, (297), 12 states have internal predecessors, (297), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 304 [2025-03-03 18:26:29,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:29,302 INFO L225 Difference]: With dead ends: 7658 [2025-03-03 18:26:29,302 INFO L226 Difference]: Without dead ends: 5362 [2025-03-03 18:26:29,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-03-03 18:26:29,306 INFO L435 NwaCegarLoop]: 926 mSDtfsCounter, 5207 mSDsluCounter, 7508 mSDsCounter, 0 mSdLazyCounter, 2621 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5208 SdHoareTripleChecker+Valid, 8434 SdHoareTripleChecker+Invalid, 2626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:29,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5208 Valid, 8434 Invalid, 2626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2621 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 18:26:29,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5362 states. [2025-03-03 18:26:29,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5362 to 3320. [2025-03-03 18:26:29,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3320 states, 3294 states have (on average 1.4544626593806922) internal successors, (4791), 3294 states have internal predecessors, (4791), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 18:26:29,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3320 states to 3320 states and 4839 transitions. [2025-03-03 18:26:29,376 INFO L78 Accepts]: Start accepts. Automaton has 3320 states and 4839 transitions. Word has length 304 [2025-03-03 18:26:29,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:29,376 INFO L471 AbstractCegarLoop]: Abstraction has 3320 states and 4839 transitions. [2025-03-03 18:26:29,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 24.75) internal successors, (297), 12 states have internal predecessors, (297), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 18:26:29,377 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 4839 transitions. [2025-03-03 18:26:29,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-03 18:26:29,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:29,381 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:29,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 18:26:29,381 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:29,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:29,381 INFO L85 PathProgramCache]: Analyzing trace with hash 511864614, now seen corresponding path program 1 times [2025-03-03 18:26:29,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:29,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227691016] [2025-03-03 18:26:29,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:29,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:29,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-03 18:26:29,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-03 18:26:29,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:29,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:30,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:30,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:30,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227691016] [2025-03-03 18:26:30,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227691016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:30,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:30,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 18:26:30,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072214310] [2025-03-03 18:26:30,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:30,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:26:30,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:30,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:26:30,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:26:30,056 INFO L87 Difference]: Start difference. First operand 3320 states and 4839 transitions. Second operand has 8 states, 8 states have (on average 37.125) internal successors, (297), 8 states have internal predecessors, (297), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:30,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:30,646 INFO L93 Difference]: Finished difference Result 5652 states and 8270 transitions. [2025-03-03 18:26:30,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:26:30,647 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 37.125) internal successors, (297), 8 states have internal predecessors, (297), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 304 [2025-03-03 18:26:30,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:30,652 INFO L225 Difference]: With dead ends: 5652 [2025-03-03 18:26:30,652 INFO L226 Difference]: Without dead ends: 3320 [2025-03-03 18:26:30,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:26:30,655 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 1451 mSDsluCounter, 3548 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1451 SdHoareTripleChecker+Valid, 4456 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:30,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1451 Valid, 4456 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:26:30,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3320 states. [2025-03-03 18:26:30,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3320 to 3320. [2025-03-03 18:26:30,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3320 states, 3294 states have (on average 1.4508196721311475) internal successors, (4779), 3294 states have internal predecessors, (4779), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 18:26:30,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3320 states to 3320 states and 4827 transitions. [2025-03-03 18:26:30,690 INFO L78 Accepts]: Start accepts. Automaton has 3320 states and 4827 transitions. Word has length 304 [2025-03-03 18:26:30,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:30,690 INFO L471 AbstractCegarLoop]: Abstraction has 3320 states and 4827 transitions. [2025-03-03 18:26:30,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 37.125) internal successors, (297), 8 states have internal predecessors, (297), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:30,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 4827 transitions. [2025-03-03 18:26:30,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-03 18:26:30,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:30,695 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:30,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 18:26:30,695 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:30,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:30,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1972866968, now seen corresponding path program 1 times [2025-03-03 18:26:30,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:30,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007149094] [2025-03-03 18:26:30,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:30,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:30,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-03 18:26:30,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-03 18:26:30,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:30,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:31,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:31,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:31,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007149094] [2025-03-03 18:26:31,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007149094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:31,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:31,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:26:31,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623271714] [2025-03-03 18:26:31,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:31,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:26:31,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:31,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:26:31,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:26:31,130 INFO L87 Difference]: Start difference. First operand 3320 states and 4827 transitions. Second operand has 6 states, 6 states have (on average 49.666666666666664) internal successors, (298), 6 states have internal predecessors, (298), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:31,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:31,710 INFO L93 Difference]: Finished difference Result 6162 states and 9012 transitions. [2025-03-03 18:26:31,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:26:31,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 49.666666666666664) internal successors, (298), 6 states have internal predecessors, (298), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 305 [2025-03-03 18:26:31,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:31,716 INFO L225 Difference]: With dead ends: 6162 [2025-03-03 18:26:31,716 INFO L226 Difference]: Without dead ends: 4253 [2025-03-03 18:26:31,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:26:31,719 INFO L435 NwaCegarLoop]: 970 mSDtfsCounter, 1227 mSDsluCounter, 3896 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 4866 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:31,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 4866 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:26:31,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4253 states. [2025-03-03 18:26:31,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4253 to 3347. [2025-03-03 18:26:31,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3347 states, 3321 states have (on average 1.4498644986449865) internal successors, (4815), 3321 states have internal predecessors, (4815), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 18:26:31,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3347 states to 3347 states and 4863 transitions. [2025-03-03 18:26:31,773 INFO L78 Accepts]: Start accepts. Automaton has 3347 states and 4863 transitions. Word has length 305 [2025-03-03 18:26:31,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:31,774 INFO L471 AbstractCegarLoop]: Abstraction has 3347 states and 4863 transitions. [2025-03-03 18:26:31,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.666666666666664) internal successors, (298), 6 states have internal predecessors, (298), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:31,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3347 states and 4863 transitions. [2025-03-03 18:26:31,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-03 18:26:31,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:31,779 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:31,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 18:26:31,780 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:31,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:31,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1933790935, now seen corresponding path program 1 times [2025-03-03 18:26:31,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:31,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114716117] [2025-03-03 18:26:31,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:31,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:31,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-03 18:26:31,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-03 18:26:31,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:31,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:32,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:32,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:32,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114716117] [2025-03-03 18:26:32,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114716117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:32,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:32,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 18:26:32,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700607461] [2025-03-03 18:26:32,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:32,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 18:26:32,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:32,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 18:26:32,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:26:32,301 INFO L87 Difference]: Start difference. First operand 3347 states and 4863 transitions. Second operand has 9 states, 9 states have (on average 33.111111111111114) internal successors, (298), 9 states have internal predecessors, (298), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:33,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:33,060 INFO L93 Difference]: Finished difference Result 6526 states and 9543 transitions. [2025-03-03 18:26:33,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:26:33,060 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 33.111111111111114) internal successors, (298), 9 states have internal predecessors, (298), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 305 [2025-03-03 18:26:33,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:33,065 INFO L225 Difference]: With dead ends: 6526 [2025-03-03 18:26:33,065 INFO L226 Difference]: Without dead ends: 4421 [2025-03-03 18:26:33,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-03 18:26:33,068 INFO L435 NwaCegarLoop]: 1101 mSDtfsCounter, 1840 mSDsluCounter, 6076 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1840 SdHoareTripleChecker+Valid, 7177 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:33,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1840 Valid, 7177 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:26:33,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4421 states. [2025-03-03 18:26:33,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4421 to 3698. [2025-03-03 18:26:33,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3698 states, 3672 states have (on average 1.4501633986928104) internal successors, (5325), 3672 states have internal predecessors, (5325), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 18:26:33,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5373 transitions. [2025-03-03 18:26:33,105 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5373 transitions. Word has length 305 [2025-03-03 18:26:33,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:33,105 INFO L471 AbstractCegarLoop]: Abstraction has 3698 states and 5373 transitions. [2025-03-03 18:26:33,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.111111111111114) internal successors, (298), 9 states have internal predecessors, (298), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:33,105 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5373 transitions. [2025-03-03 18:26:33,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-03 18:26:33,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:33,111 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:33,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 18:26:33,111 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:33,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:33,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1672025332, now seen corresponding path program 1 times [2025-03-03 18:26:33,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:33,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713308855] [2025-03-03 18:26:33,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:33,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:33,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-03 18:26:33,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-03 18:26:33,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:33,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:33,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:33,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:33,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713308855] [2025-03-03 18:26:33,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713308855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:33,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:33,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:26:33,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299113426] [2025-03-03 18:26:33,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:33,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:26:33,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:33,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:26:33,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:26:33,698 INFO L87 Difference]: Start difference. First operand 3698 states and 5373 transitions. Second operand has 6 states, 6 states have (on average 49.666666666666664) internal successors, (298), 6 states have internal predecessors, (298), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:34,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:34,201 INFO L93 Difference]: Finished difference Result 6366 states and 9261 transitions. [2025-03-03 18:26:34,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:26:34,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 49.666666666666664) internal successors, (298), 6 states have internal predecessors, (298), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 305 [2025-03-03 18:26:34,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:34,207 INFO L225 Difference]: With dead ends: 6366 [2025-03-03 18:26:34,207 INFO L226 Difference]: Without dead ends: 4678 [2025-03-03 18:26:34,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:26:34,210 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 1770 mSDsluCounter, 2745 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1772 SdHoareTripleChecker+Valid, 3685 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:34,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1772 Valid, 3685 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:26:34,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4678 states. [2025-03-03 18:26:34,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4678 to 4632. [2025-03-03 18:26:34,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4632 states, 4598 states have (on average 1.448455850369726) internal successors, (6660), 4598 states have internal predecessors, (6660), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 18:26:34,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 6724 transitions. [2025-03-03 18:26:34,258 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 6724 transitions. Word has length 305 [2025-03-03 18:26:34,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:34,258 INFO L471 AbstractCegarLoop]: Abstraction has 4632 states and 6724 transitions. [2025-03-03 18:26:34,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.666666666666664) internal successors, (298), 6 states have internal predecessors, (298), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:34,259 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 6724 transitions. [2025-03-03 18:26:34,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-03-03 18:26:34,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:34,263 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:34,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 18:26:34,264 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:34,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:34,264 INFO L85 PathProgramCache]: Analyzing trace with hash -720372868, now seen corresponding path program 1 times [2025-03-03 18:26:34,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:34,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832651678] [2025-03-03 18:26:34,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:34,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:34,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-03 18:26:34,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-03 18:26:34,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:34,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:34,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:34,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:34,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832651678] [2025-03-03 18:26:34,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832651678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:34,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:34,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:26:34,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746909930] [2025-03-03 18:26:34,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:34,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:26:34,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:34,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:26:34,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:26:34,662 INFO L87 Difference]: Start difference. First operand 4632 states and 6724 transitions. Second operand has 6 states, 6 states have (on average 49.833333333333336) internal successors, (299), 6 states have internal predecessors, (299), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:35,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:35,151 INFO L93 Difference]: Finished difference Result 6734 states and 9813 transitions. [2025-03-03 18:26:35,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:26:35,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 49.833333333333336) internal successors, (299), 6 states have internal predecessors, (299), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 306 [2025-03-03 18:26:35,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:35,156 INFO L225 Difference]: With dead ends: 6734 [2025-03-03 18:26:35,156 INFO L226 Difference]: Without dead ends: 5046 [2025-03-03 18:26:35,158 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-03 18:26:35,159 INFO L435 NwaCegarLoop]: 973 mSDtfsCounter, 615 mSDsluCounter, 3887 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 4860 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:35,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 4860 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:26:35,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5046 states. [2025-03-03 18:26:35,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5046 to 4680. [2025-03-03 18:26:35,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4680 states, 4646 states have (on average 1.4485578992681878) internal successors, (6730), 4646 states have internal predecessors, (6730), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 18:26:35,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 6794 transitions. [2025-03-03 18:26:35,212 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 6794 transitions. Word has length 306 [2025-03-03 18:26:35,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:35,213 INFO L471 AbstractCegarLoop]: Abstraction has 4680 states and 6794 transitions. [2025-03-03 18:26:35,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.833333333333336) internal successors, (299), 6 states have internal predecessors, (299), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:35,213 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 6794 transitions. [2025-03-03 18:26:35,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-03 18:26:35,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:35,218 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:35,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 18:26:35,218 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:35,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:35,219 INFO L85 PathProgramCache]: Analyzing trace with hash -997263257, now seen corresponding path program 1 times [2025-03-03 18:26:35,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:35,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323990676] [2025-03-03 18:26:35,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:35,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:35,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-03 18:26:35,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-03 18:26:35,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:35,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:35,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:35,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:35,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323990676] [2025-03-03 18:26:35,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323990676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:35,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:35,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:26:35,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030122543] [2025-03-03 18:26:35,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:35,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:26:35,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:35,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:26:35,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:26:35,598 INFO L87 Difference]: Start difference. First operand 4680 states and 6794 transitions. Second operand has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:35,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:35,986 INFO L93 Difference]: Finished difference Result 6376 states and 9275 transitions. [2025-03-03 18:26:35,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:26:35,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 307 [2025-03-03 18:26:35,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:35,990 INFO L225 Difference]: With dead ends: 6376 [2025-03-03 18:26:35,990 INFO L226 Difference]: Without dead ends: 4688 [2025-03-03 18:26:35,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:26:35,992 INFO L435 NwaCegarLoop]: 994 mSDtfsCounter, 1011 mSDsluCounter, 2972 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 3966 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:35,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 3966 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:26:35,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4688 states. [2025-03-03 18:26:36,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4688 to 4684. [2025-03-03 18:26:36,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4684 states, 4650 states have (on average 1.4481720430107528) internal successors, (6734), 4650 states have internal predecessors, (6734), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 18:26:36,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 6798 transitions. [2025-03-03 18:26:36,035 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 6798 transitions. Word has length 307 [2025-03-03 18:26:36,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:36,035 INFO L471 AbstractCegarLoop]: Abstraction has 4684 states and 6798 transitions. [2025-03-03 18:26:36,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:36,035 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 6798 transitions. [2025-03-03 18:26:36,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-03 18:26:36,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:36,041 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:36,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 18:26:36,041 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:36,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:36,042 INFO L85 PathProgramCache]: Analyzing trace with hash 36278199, now seen corresponding path program 1 times [2025-03-03 18:26:36,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:36,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914946720] [2025-03-03 18:26:36,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:36,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:36,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-03 18:26:36,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-03 18:26:36,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:36,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:36,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:36,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:36,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914946720] [2025-03-03 18:26:36,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914946720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:36,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:36,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:26:36,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224196354] [2025-03-03 18:26:36,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:36,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:26:36,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:36,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:26:36,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:26:36,607 INFO L87 Difference]: Start difference. First operand 4684 states and 6798 transitions. Second operand has 7 states, 7 states have (on average 42.857142857142854) internal successors, (300), 7 states have internal predecessors, (300), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:37,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:37,369 INFO L93 Difference]: Finished difference Result 6796 states and 9895 transitions. [2025-03-03 18:26:37,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:26:37,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 42.857142857142854) internal successors, (300), 7 states have internal predecessors, (300), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 307 [2025-03-03 18:26:37,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:37,374 INFO L225 Difference]: With dead ends: 6796 [2025-03-03 18:26:37,374 INFO L226 Difference]: Without dead ends: 5094 [2025-03-03 18:26:37,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:26:37,376 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 1815 mSDsluCounter, 5423 mSDsCounter, 0 mSdLazyCounter, 2053 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1817 SdHoareTripleChecker+Valid, 6944 SdHoareTripleChecker+Invalid, 2053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:37,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1817 Valid, 6944 Invalid, 2053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2053 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:26:37,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5094 states. [2025-03-03 18:26:37,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5094 to 4684. [2025-03-03 18:26:37,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4684 states, 4650 states have (on average 1.447741935483871) internal successors, (6732), 4650 states have internal predecessors, (6732), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 18:26:37,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 6796 transitions. [2025-03-03 18:26:37,424 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 6796 transitions. Word has length 307 [2025-03-03 18:26:37,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:37,424 INFO L471 AbstractCegarLoop]: Abstraction has 4684 states and 6796 transitions. [2025-03-03 18:26:37,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 42.857142857142854) internal successors, (300), 7 states have internal predecessors, (300), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:37,424 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 6796 transitions. [2025-03-03 18:26:37,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-03 18:26:37,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:37,428 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:37,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 18:26:37,428 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:37,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:37,428 INFO L85 PathProgramCache]: Analyzing trace with hash -357080625, now seen corresponding path program 1 times [2025-03-03 18:26:37,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:37,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130109696] [2025-03-03 18:26:37,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:37,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:37,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-03 18:26:37,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-03 18:26:37,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:37,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:38,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:38,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:38,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130109696] [2025-03-03 18:26:38,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130109696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:38,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:38,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:26:38,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899386110] [2025-03-03 18:26:38,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:38,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:26:38,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:38,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:26:38,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:26:38,301 INFO L87 Difference]: Start difference. First operand 4684 states and 6796 transitions. Second operand has 10 states, 10 states have (on average 30.0) internal successors, (300), 10 states have internal predecessors, (300), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:39,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:39,195 INFO L93 Difference]: Finished difference Result 7526 states and 10969 transitions. [2025-03-03 18:26:39,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 18:26:39,195 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 30.0) internal successors, (300), 10 states have internal predecessors, (300), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 307 [2025-03-03 18:26:39,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:39,200 INFO L225 Difference]: With dead ends: 7526 [2025-03-03 18:26:39,200 INFO L226 Difference]: Without dead ends: 4696 [2025-03-03 18:26:39,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-03 18:26:39,203 INFO L435 NwaCegarLoop]: 899 mSDtfsCounter, 1464 mSDsluCounter, 5272 mSDsCounter, 0 mSdLazyCounter, 2091 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 6171 SdHoareTripleChecker+Invalid, 2093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:39,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 6171 Invalid, 2093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2091 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 18:26:39,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4696 states. [2025-03-03 18:26:39,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4696 to 4072. [2025-03-03 18:26:39,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4072 states, 4046 states have (on average 1.453287197231834) internal successors, (5880), 4046 states have internal predecessors, (5880), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 18:26:39,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4072 states to 4072 states and 5928 transitions. [2025-03-03 18:26:39,260 INFO L78 Accepts]: Start accepts. Automaton has 4072 states and 5928 transitions. Word has length 307 [2025-03-03 18:26:39,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:39,260 INFO L471 AbstractCegarLoop]: Abstraction has 4072 states and 5928 transitions. [2025-03-03 18:26:39,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 30.0) internal successors, (300), 10 states have internal predecessors, (300), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:39,260 INFO L276 IsEmpty]: Start isEmpty. Operand 4072 states and 5928 transitions. [2025-03-03 18:26:39,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-03 18:26:39,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:39,265 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:39,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 18:26:39,265 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:39,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:39,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1693067142, now seen corresponding path program 1 times [2025-03-03 18:26:39,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:39,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024009088] [2025-03-03 18:26:39,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:39,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:39,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-03 18:26:39,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-03 18:26:39,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:39,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:39,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:39,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:39,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024009088] [2025-03-03 18:26:39,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024009088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:39,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:39,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:26:39,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110437460] [2025-03-03 18:26:39,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:39,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:26:39,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:39,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:26:39,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:26:39,727 INFO L87 Difference]: Start difference. First operand 4072 states and 5928 transitions. Second operand has 6 states, 6 states have (on average 50.166666666666664) internal successors, (301), 6 states have internal predecessors, (301), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:40,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:40,249 INFO L93 Difference]: Finished difference Result 7466 states and 10932 transitions. [2025-03-03 18:26:40,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:26:40,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 50.166666666666664) internal successors, (301), 6 states have internal predecessors, (301), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 308 [2025-03-03 18:26:40,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:40,255 INFO L225 Difference]: With dead ends: 7466 [2025-03-03 18:26:40,255 INFO L226 Difference]: Without dead ends: 5328 [2025-03-03 18:26:40,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:26:40,257 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 1220 mSDsluCounter, 3899 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 4870 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:40,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1220 Valid, 4870 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:26:40,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5328 states. [2025-03-03 18:26:40,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5328 to 4136. [2025-03-03 18:26:40,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4136 states, 4110 states have (on average 1.4520681265206812) internal successors, (5968), 4110 states have internal predecessors, (5968), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 18:26:40,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4136 states to 4136 states and 6016 transitions. [2025-03-03 18:26:40,297 INFO L78 Accepts]: Start accepts. Automaton has 4136 states and 6016 transitions. Word has length 308 [2025-03-03 18:26:40,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:40,298 INFO L471 AbstractCegarLoop]: Abstraction has 4136 states and 6016 transitions. [2025-03-03 18:26:40,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 50.166666666666664) internal successors, (301), 6 states have internal predecessors, (301), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:40,298 INFO L276 IsEmpty]: Start isEmpty. Operand 4136 states and 6016 transitions. [2025-03-03 18:26:40,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-03 18:26:40,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:40,301 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:40,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 18:26:40,301 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:40,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:40,302 INFO L85 PathProgramCache]: Analyzing trace with hash 590281330, now seen corresponding path program 1 times [2025-03-03 18:26:40,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:40,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350007852] [2025-03-03 18:26:40,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:40,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:40,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-03 18:26:40,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-03 18:26:40,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:40,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:40,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:40,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:40,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350007852] [2025-03-03 18:26:40,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350007852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:40,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:40,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:26:40,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091361559] [2025-03-03 18:26:40,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:40,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:26:40,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:40,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:26:40,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:26:40,686 INFO L87 Difference]: Start difference. First operand 4136 states and 6016 transitions. Second operand has 6 states, 6 states have (on average 50.166666666666664) internal successors, (301), 6 states have internal predecessors, (301), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:41,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:41,046 INFO L93 Difference]: Finished difference Result 6525 states and 9526 transitions. [2025-03-03 18:26:41,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:26:41,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 50.166666666666664) internal successors, (301), 6 states have internal predecessors, (301), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 308 [2025-03-03 18:26:41,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:41,051 INFO L225 Difference]: With dead ends: 6525 [2025-03-03 18:26:41,051 INFO L226 Difference]: Without dead ends: 4168 [2025-03-03 18:26:41,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:26:41,053 INFO L435 NwaCegarLoop]: 995 mSDtfsCounter, 1089 mSDsluCounter, 2955 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 3950 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:41,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 3950 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:26:41,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4168 states. [2025-03-03 18:26:41,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4168 to 4152. [2025-03-03 18:26:41,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4152 states, 4126 states have (on average 1.450315075133301) internal successors, (5984), 4126 states have internal predecessors, (5984), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 18:26:41,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4152 states to 4152 states and 6032 transitions. [2025-03-03 18:26:41,087 INFO L78 Accepts]: Start accepts. Automaton has 4152 states and 6032 transitions. Word has length 308 [2025-03-03 18:26:41,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:41,087 INFO L471 AbstractCegarLoop]: Abstraction has 4152 states and 6032 transitions. [2025-03-03 18:26:41,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 50.166666666666664) internal successors, (301), 6 states have internal predecessors, (301), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:41,088 INFO L276 IsEmpty]: Start isEmpty. Operand 4152 states and 6032 transitions. [2025-03-03 18:26:41,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-03 18:26:41,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:41,091 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:41,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 18:26:41,091 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:41,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:41,091 INFO L85 PathProgramCache]: Analyzing trace with hash -916291090, now seen corresponding path program 1 times [2025-03-03 18:26:41,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:41,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992905392] [2025-03-03 18:26:41,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:41,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:41,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-03 18:26:41,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-03 18:26:41,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:41,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:41,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:41,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:41,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992905392] [2025-03-03 18:26:41,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992905392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:41,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:41,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:26:41,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556065636] [2025-03-03 18:26:41,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:41,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:26:41,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:41,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:26:41,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:26:41,616 INFO L87 Difference]: Start difference. First operand 4152 states and 6032 transitions. Second operand has 7 states, 7 states have (on average 43.0) internal successors, (301), 7 states have internal predecessors, (301), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:42,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:42,234 INFO L93 Difference]: Finished difference Result 6145 states and 8960 transitions. [2025-03-03 18:26:42,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:26:42,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 43.0) internal successors, (301), 7 states have internal predecessors, (301), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 308 [2025-03-03 18:26:42,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:42,238 INFO L225 Difference]: With dead ends: 6145 [2025-03-03 18:26:42,238 INFO L226 Difference]: Without dead ends: 4586 [2025-03-03 18:26:42,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:26:42,240 INFO L435 NwaCegarLoop]: 914 mSDtfsCounter, 2049 mSDsluCounter, 3608 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2051 SdHoareTripleChecker+Valid, 4522 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:42,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2051 Valid, 4522 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1415 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:26:42,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4586 states. [2025-03-03 18:26:42,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4586 to 4168. [2025-03-03 18:26:42,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4168 states, 4142 states have (on average 1.4495412844036697) internal successors, (6004), 4142 states have internal predecessors, (6004), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 18:26:42,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 6052 transitions. [2025-03-03 18:26:42,275 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 6052 transitions. Word has length 308 [2025-03-03 18:26:42,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:42,275 INFO L471 AbstractCegarLoop]: Abstraction has 4168 states and 6052 transitions. [2025-03-03 18:26:42,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.0) internal successors, (301), 7 states have internal predecessors, (301), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:42,275 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 6052 transitions. [2025-03-03 18:26:42,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-03-03 18:26:42,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:42,279 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:42,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 18:26:42,279 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:42,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:42,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1646791914, now seen corresponding path program 1 times [2025-03-03 18:26:42,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:42,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277126745] [2025-03-03 18:26:42,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:42,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:42,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-03 18:26:42,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-03 18:26:42,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:42,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:42,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:42,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:42,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277126745] [2025-03-03 18:26:42,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277126745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:42,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:42,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 18:26:42,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034907137] [2025-03-03 18:26:42,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:42,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 18:26:42,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:42,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 18:26:42,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:26:42,885 INFO L87 Difference]: Start difference. First operand 4168 states and 6052 transitions. Second operand has 9 states, 9 states have (on average 33.55555555555556) internal successors, (302), 9 states have internal predecessors, (302), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:43,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:43,706 INFO L93 Difference]: Finished difference Result 6141 states and 8950 transitions. [2025-03-03 18:26:43,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 18:26:43,707 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 33.55555555555556) internal successors, (302), 9 states have internal predecessors, (302), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 309 [2025-03-03 18:26:43,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:43,711 INFO L225 Difference]: With dead ends: 6141 [2025-03-03 18:26:43,711 INFO L226 Difference]: Without dead ends: 4546 [2025-03-03 18:26:43,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:26:43,714 INFO L435 NwaCegarLoop]: 964 mSDtfsCounter, 2110 mSDsluCounter, 5755 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2112 SdHoareTripleChecker+Valid, 6719 SdHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:43,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2112 Valid, 6719 Invalid, 1661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:26:43,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4546 states. [2025-03-03 18:26:43,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4546 to 4172. [2025-03-03 18:26:43,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4172 states, 4146 states have (on average 1.4491075735648817) internal successors, (6008), 4146 states have internal predecessors, (6008), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 18:26:43,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4172 states to 4172 states and 6056 transitions. [2025-03-03 18:26:43,749 INFO L78 Accepts]: Start accepts. Automaton has 4172 states and 6056 transitions. Word has length 309 [2025-03-03 18:26:43,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:43,750 INFO L471 AbstractCegarLoop]: Abstraction has 4172 states and 6056 transitions. [2025-03-03 18:26:43,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.55555555555556) internal successors, (302), 9 states have internal predecessors, (302), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:43,750 INFO L276 IsEmpty]: Start isEmpty. Operand 4172 states and 6056 transitions. [2025-03-03 18:26:43,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-03-03 18:26:43,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:43,753 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:43,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 18:26:43,753 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:43,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:43,754 INFO L85 PathProgramCache]: Analyzing trace with hash 2026622895, now seen corresponding path program 1 times [2025-03-03 18:26:43,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:43,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799778237] [2025-03-03 18:26:43,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:43,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:43,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-03 18:26:43,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-03 18:26:43,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:43,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:44,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:44,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:44,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799778237] [2025-03-03 18:26:44,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799778237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:44,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:44,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:26:44,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209633358] [2025-03-03 18:26:44,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:44,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:26:44,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:44,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:26:44,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:26:44,251 INFO L87 Difference]: Start difference. First operand 4172 states and 6056 transitions. Second operand has 7 states, 7 states have (on average 43.142857142857146) internal successors, (302), 7 states have internal predecessors, (302), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:45,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:45,039 INFO L93 Difference]: Finished difference Result 6141 states and 8950 transitions. [2025-03-03 18:26:45,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:26:45,040 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 43.142857142857146) internal successors, (302), 7 states have internal predecessors, (302), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 309 [2025-03-03 18:26:45,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:45,044 INFO L225 Difference]: With dead ends: 6141 [2025-03-03 18:26:45,044 INFO L226 Difference]: Without dead ends: 4582 [2025-03-03 18:26:45,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:26:45,047 INFO L435 NwaCegarLoop]: 1519 mSDtfsCounter, 1799 mSDsluCounter, 5382 mSDsCounter, 0 mSdLazyCounter, 2080 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1801 SdHoareTripleChecker+Valid, 6901 SdHoareTripleChecker+Invalid, 2080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:45,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1801 Valid, 6901 Invalid, 2080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2080 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:26:45,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4582 states. [2025-03-03 18:26:45,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4582 to 4172. [2025-03-03 18:26:45,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4172 states, 4146 states have (on average 1.4491075735648817) internal successors, (6008), 4146 states have internal predecessors, (6008), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 18:26:45,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4172 states to 4172 states and 6056 transitions. [2025-03-03 18:26:45,113 INFO L78 Accepts]: Start accepts. Automaton has 4172 states and 6056 transitions. Word has length 309 [2025-03-03 18:26:45,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:45,113 INFO L471 AbstractCegarLoop]: Abstraction has 4172 states and 6056 transitions. [2025-03-03 18:26:45,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.142857142857146) internal successors, (302), 7 states have internal predecessors, (302), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:45,113 INFO L276 IsEmpty]: Start isEmpty. Operand 4172 states and 6056 transitions. [2025-03-03 18:26:45,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-03-03 18:26:45,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:45,117 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:45,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 18:26:45,117 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:45,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:45,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1932164055, now seen corresponding path program 1 times [2025-03-03 18:26:45,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:45,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142928346] [2025-03-03 18:26:45,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:45,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:45,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-03 18:26:45,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-03 18:26:45,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:45,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:45,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:45,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:45,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142928346] [2025-03-03 18:26:45,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142928346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:45,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:45,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 18:26:45,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280454166] [2025-03-03 18:26:45,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:45,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 18:26:45,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:45,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 18:26:45,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:26:45,867 INFO L87 Difference]: Start difference. First operand 4172 states and 6056 transitions. Second operand has 11 states, 11 states have (on average 27.454545454545453) internal successors, (302), 11 states have internal predecessors, (302), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 18:26:47,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:47,135 INFO L93 Difference]: Finished difference Result 8572 states and 12456 transitions. [2025-03-03 18:26:47,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 18:26:47,135 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 27.454545454545453) internal successors, (302), 11 states have internal predecessors, (302), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 309 [2025-03-03 18:26:47,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:47,141 INFO L225 Difference]: With dead ends: 8572 [2025-03-03 18:26:47,141 INFO L226 Difference]: Without dead ends: 6979 [2025-03-03 18:26:47,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2025-03-03 18:26:47,144 INFO L435 NwaCegarLoop]: 1474 mSDtfsCounter, 2202 mSDsluCounter, 9537 mSDsCounter, 0 mSdLazyCounter, 3105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2205 SdHoareTripleChecker+Valid, 11011 SdHoareTripleChecker+Invalid, 3107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:47,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2205 Valid, 11011 Invalid, 3107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3105 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 18:26:47,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6979 states. [2025-03-03 18:26:47,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6979 to 5698. [2025-03-03 18:26:47,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5698 states, 5666 states have (on average 1.4472290857747971) internal successors, (8200), 5666 states have internal predecessors, (8200), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 18:26:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5698 states to 5698 states and 8260 transitions. [2025-03-03 18:26:47,190 INFO L78 Accepts]: Start accepts. Automaton has 5698 states and 8260 transitions. Word has length 309 [2025-03-03 18:26:47,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:47,190 INFO L471 AbstractCegarLoop]: Abstraction has 5698 states and 8260 transitions. [2025-03-03 18:26:47,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.454545454545453) internal successors, (302), 11 states have internal predecessors, (302), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 18:26:47,190 INFO L276 IsEmpty]: Start isEmpty. Operand 5698 states and 8260 transitions. [2025-03-03 18:26:47,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-03-03 18:26:47,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:47,194 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:47,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 18:26:47,195 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:47,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:47,195 INFO L85 PathProgramCache]: Analyzing trace with hash -812329186, now seen corresponding path program 1 times [2025-03-03 18:26:47,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:47,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215584322] [2025-03-03 18:26:47,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:47,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:47,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-03-03 18:26:47,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-03-03 18:26:47,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:47,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:47,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:47,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:47,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215584322] [2025-03-03 18:26:47,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215584322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:47,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:47,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:26:47,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902774545] [2025-03-03 18:26:47,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:47,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:26:47,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:47,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:26:47,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:26:47,712 INFO L87 Difference]: Start difference. First operand 5698 states and 8260 transitions. Second operand has 7 states, 7 states have (on average 43.285714285714285) internal successors, (303), 7 states have internal predecessors, (303), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:48,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:48,234 INFO L93 Difference]: Finished difference Result 9591 states and 13986 transitions. [2025-03-03 18:26:48,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:26:48,235 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 43.285714285714285) internal successors, (303), 7 states have internal predecessors, (303), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 310 [2025-03-03 18:26:48,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:48,240 INFO L225 Difference]: With dead ends: 9591 [2025-03-03 18:26:48,240 INFO L226 Difference]: Without dead ends: 5698 [2025-03-03 18:26:48,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:26:48,244 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 2342 mSDsluCounter, 2633 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2342 SdHoareTripleChecker+Valid, 3541 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:48,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2342 Valid, 3541 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:26:48,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5698 states. [2025-03-03 18:26:48,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5698 to 5698. [2025-03-03 18:26:48,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5698 states, 5666 states have (on average 1.440875397105542) internal successors, (8164), 5666 states have internal predecessors, (8164), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 18:26:48,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5698 states to 5698 states and 8224 transitions. [2025-03-03 18:26:48,309 INFO L78 Accepts]: Start accepts. Automaton has 5698 states and 8224 transitions. Word has length 310 [2025-03-03 18:26:48,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:48,310 INFO L471 AbstractCegarLoop]: Abstraction has 5698 states and 8224 transitions. [2025-03-03 18:26:48,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.285714285714285) internal successors, (303), 7 states have internal predecessors, (303), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:48,310 INFO L276 IsEmpty]: Start isEmpty. Operand 5698 states and 8224 transitions. [2025-03-03 18:26:48,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-03 18:26:48,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:48,316 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:48,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 18:26:48,316 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:48,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:48,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1157762324, now seen corresponding path program 1 times [2025-03-03 18:26:48,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:48,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735213882] [2025-03-03 18:26:48,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:48,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:48,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-03 18:26:48,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-03 18:26:48,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:48,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:49,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:49,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:49,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735213882] [2025-03-03 18:26:49,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735213882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:49,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:49,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:26:49,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13401114] [2025-03-03 18:26:49,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:49,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:26:49,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:49,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:26:49,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:26:49,073 INFO L87 Difference]: Start difference. First operand 5698 states and 8224 transitions. Second operand has 10 states, 10 states have (on average 30.4) internal successors, (304), 10 states have internal predecessors, (304), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:49,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:49,930 INFO L93 Difference]: Finished difference Result 9808 states and 14254 transitions. [2025-03-03 18:26:49,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 18:26:49,932 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 30.4) internal successors, (304), 10 states have internal predecessors, (304), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 311 [2025-03-03 18:26:49,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:49,939 INFO L225 Difference]: With dead ends: 9808 [2025-03-03 18:26:49,939 INFO L226 Difference]: Without dead ends: 7332 [2025-03-03 18:26:49,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-03 18:26:49,942 INFO L435 NwaCegarLoop]: 961 mSDtfsCounter, 3293 mSDsluCounter, 6688 mSDsCounter, 0 mSdLazyCounter, 1946 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3295 SdHoareTripleChecker+Valid, 7649 SdHoareTripleChecker+Invalid, 1946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:49,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3295 Valid, 7649 Invalid, 1946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1946 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:26:49,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7332 states. [2025-03-03 18:26:50,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7332 to 5710. [2025-03-03 18:26:50,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5710 states, 5678 states have (on average 1.4399436421275096) internal successors, (8176), 5678 states have internal predecessors, (8176), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 18:26:50,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5710 states to 5710 states and 8236 transitions. [2025-03-03 18:26:50,022 INFO L78 Accepts]: Start accepts. Automaton has 5710 states and 8236 transitions. Word has length 311 [2025-03-03 18:26:50,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:50,022 INFO L471 AbstractCegarLoop]: Abstraction has 5710 states and 8236 transitions. [2025-03-03 18:26:50,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 30.4) internal successors, (304), 10 states have internal predecessors, (304), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:50,022 INFO L276 IsEmpty]: Start isEmpty. Operand 5710 states and 8236 transitions. [2025-03-03 18:26:50,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-03 18:26:50,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:50,026 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:50,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-03 18:26:50,027 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:50,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:50,027 INFO L85 PathProgramCache]: Analyzing trace with hash -747106064, now seen corresponding path program 1 times [2025-03-03 18:26:50,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:50,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871287672] [2025-03-03 18:26:50,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:50,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:50,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-03 18:26:50,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-03 18:26:50,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:50,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:50,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:50,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:50,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871287672] [2025-03-03 18:26:50,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871287672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:50,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:50,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 18:26:50,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726761911] [2025-03-03 18:26:50,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:50,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 18:26:50,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:50,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 18:26:50,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:26:50,881 INFO L87 Difference]: Start difference. First operand 5710 states and 8236 transitions. Second operand has 12 states, 12 states have (on average 25.333333333333332) internal successors, (304), 12 states have internal predecessors, (304), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 18:26:52,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:52,316 INFO L93 Difference]: Finished difference Result 10647 states and 15431 transitions. [2025-03-03 18:26:52,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 18:26:52,317 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 25.333333333333332) internal successors, (304), 12 states have internal predecessors, (304), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 311 [2025-03-03 18:26:52,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:52,323 INFO L225 Difference]: With dead ends: 10647 [2025-03-03 18:26:52,323 INFO L226 Difference]: Without dead ends: 7958 [2025-03-03 18:26:52,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-03-03 18:26:52,326 INFO L435 NwaCegarLoop]: 1646 mSDtfsCounter, 2403 mSDsluCounter, 10870 mSDsCounter, 0 mSdLazyCounter, 3707 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2404 SdHoareTripleChecker+Valid, 12516 SdHoareTripleChecker+Invalid, 3709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:52,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2404 Valid, 12516 Invalid, 3709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3707 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 18:26:52,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7958 states. [2025-03-03 18:26:52,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7958 to 6068. [2025-03-03 18:26:52,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6068 states, 6032 states have (on average 1.4366710875331565) internal successors, (8666), 6032 states have internal predecessors, (8666), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-03 18:26:52,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6068 states to 6068 states and 8734 transitions. [2025-03-03 18:26:52,376 INFO L78 Accepts]: Start accepts. Automaton has 6068 states and 8734 transitions. Word has length 311 [2025-03-03 18:26:52,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:52,376 INFO L471 AbstractCegarLoop]: Abstraction has 6068 states and 8734 transitions. [2025-03-03 18:26:52,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 25.333333333333332) internal successors, (304), 12 states have internal predecessors, (304), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 18:26:52,376 INFO L276 IsEmpty]: Start isEmpty. Operand 6068 states and 8734 transitions. [2025-03-03 18:26:52,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-03 18:26:52,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:52,380 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:52,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-03 18:26:52,380 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:52,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:52,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1213181769, now seen corresponding path program 1 times [2025-03-03 18:26:52,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:52,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288573719] [2025-03-03 18:26:52,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:52,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:52,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-03 18:26:52,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-03 18:26:52,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:52,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:52,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:52,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:52,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288573719] [2025-03-03 18:26:52,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288573719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:52,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:52,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:26:52,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125699768] [2025-03-03 18:26:52,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:52,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:26:52,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:52,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:26:52,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:26:52,899 INFO L87 Difference]: Start difference. First operand 6068 states and 8734 transitions. Second operand has 7 states, 7 states have (on average 43.42857142857143) internal successors, (304), 7 states have internal predecessors, (304), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:53,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:53,548 INFO L93 Difference]: Finished difference Result 8222 states and 11881 transitions. [2025-03-03 18:26:53,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:26:53,548 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 43.42857142857143) internal successors, (304), 7 states have internal predecessors, (304), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 311 [2025-03-03 18:26:53,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:53,554 INFO L225 Difference]: With dead ends: 8222 [2025-03-03 18:26:53,554 INFO L226 Difference]: Without dead ends: 6486 [2025-03-03 18:26:53,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:26:53,557 INFO L435 NwaCegarLoop]: 913 mSDtfsCounter, 2033 mSDsluCounter, 3608 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2035 SdHoareTripleChecker+Valid, 4521 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:53,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2035 Valid, 4521 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1417 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:26:53,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6486 states. [2025-03-03 18:26:53,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6486 to 5299. [2025-03-03 18:26:53,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5299 states, 5266 states have (on average 1.4379035320926699) internal successors, (7572), 5266 states have internal predecessors, (7572), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 18:26:53,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 7634 transitions. [2025-03-03 18:26:53,599 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 7634 transitions. Word has length 311 [2025-03-03 18:26:53,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:53,599 INFO L471 AbstractCegarLoop]: Abstraction has 5299 states and 7634 transitions. [2025-03-03 18:26:53,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.42857142857143) internal successors, (304), 7 states have internal predecessors, (304), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:53,599 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 7634 transitions. [2025-03-03 18:26:53,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-03 18:26:53,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:53,603 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:53,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-03 18:26:53,603 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:53,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:53,603 INFO L85 PathProgramCache]: Analyzing trace with hash -316633413, now seen corresponding path program 1 times [2025-03-03 18:26:53,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:53,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444042707] [2025-03-03 18:26:53,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:53,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:53,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-03 18:26:53,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-03 18:26:53,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:53,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:53,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:53,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:53,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444042707] [2025-03-03 18:26:53,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444042707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:53,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:53,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:26:53,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311142397] [2025-03-03 18:26:53,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:53,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:26:53,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:53,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:26:53,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:26:53,870 INFO L87 Difference]: Start difference. First operand 5299 states and 7634 transitions. Second operand has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:54,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:54,187 INFO L93 Difference]: Finished difference Result 8953 states and 12971 transitions. [2025-03-03 18:26:54,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:26:54,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 312 [2025-03-03 18:26:54,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:54,193 INFO L225 Difference]: With dead ends: 8953 [2025-03-03 18:26:54,193 INFO L226 Difference]: Without dead ends: 5419 [2025-03-03 18:26:54,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:26:54,196 INFO L435 NwaCegarLoop]: 1001 mSDtfsCounter, 2 mSDsluCounter, 2988 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3989 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:54,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3989 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:26:54,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5419 states. [2025-03-03 18:26:54,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5419 to 5389. [2025-03-03 18:26:54,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5389 states, 5356 states have (on average 1.4342793129200897) internal successors, (7682), 5356 states have internal predecessors, (7682), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 18:26:54,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5389 states to 5389 states and 7744 transitions. [2025-03-03 18:26:54,238 INFO L78 Accepts]: Start accepts. Automaton has 5389 states and 7744 transitions. Word has length 312 [2025-03-03 18:26:54,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:54,238 INFO L471 AbstractCegarLoop]: Abstraction has 5389 states and 7744 transitions. [2025-03-03 18:26:54,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:54,238 INFO L276 IsEmpty]: Start isEmpty. Operand 5389 states and 7744 transitions. [2025-03-03 18:26:54,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-03 18:26:54,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:54,242 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:54,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-03 18:26:54,242 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:54,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:54,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1432366589, now seen corresponding path program 1 times [2025-03-03 18:26:54,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:54,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096466454] [2025-03-03 18:26:54,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:54,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:54,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-03 18:26:54,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-03 18:26:54,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:54,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:54,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:54,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096466454] [2025-03-03 18:26:54,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096466454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:54,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:54,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:26:54,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245739265] [2025-03-03 18:26:54,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:54,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:26:54,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:54,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:26:54,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:26:54,615 INFO L87 Difference]: Start difference. First operand 5389 states and 7744 transitions. Second operand has 6 states, 6 states have (on average 50.833333333333336) internal successors, (305), 6 states have internal predecessors, (305), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:55,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:55,154 INFO L93 Difference]: Finished difference Result 9300 states and 13469 transitions. [2025-03-03 18:26:55,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:26:55,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 50.833333333333336) internal successors, (305), 6 states have internal predecessors, (305), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 312 [2025-03-03 18:26:55,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:55,161 INFO L225 Difference]: With dead ends: 9300 [2025-03-03 18:26:55,162 INFO L226 Difference]: Without dead ends: 6799 [2025-03-03 18:26:55,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:26:55,164 INFO L435 NwaCegarLoop]: 970 mSDtfsCounter, 1212 mSDsluCounter, 3895 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 4865 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:55,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 4865 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:26:55,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6799 states. [2025-03-03 18:26:55,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6799 to 5469. [2025-03-03 18:26:55,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5469 states, 5436 states have (on average 1.4334069168506254) internal successors, (7792), 5436 states have internal predecessors, (7792), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 18:26:55,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5469 states to 5469 states and 7854 transitions. [2025-03-03 18:26:55,213 INFO L78 Accepts]: Start accepts. Automaton has 5469 states and 7854 transitions. Word has length 312 [2025-03-03 18:26:55,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:55,213 INFO L471 AbstractCegarLoop]: Abstraction has 5469 states and 7854 transitions. [2025-03-03 18:26:55,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 50.833333333333336) internal successors, (305), 6 states have internal predecessors, (305), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:55,213 INFO L276 IsEmpty]: Start isEmpty. Operand 5469 states and 7854 transitions. [2025-03-03 18:26:55,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-03 18:26:55,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:55,218 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:55,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-03 18:26:55,219 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:55,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:55,219 INFO L85 PathProgramCache]: Analyzing trace with hash 427753379, now seen corresponding path program 1 times [2025-03-03 18:26:55,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:55,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332246206] [2025-03-03 18:26:55,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:55,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:55,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-03 18:26:55,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-03 18:26:55,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:55,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:55,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:55,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:55,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332246206] [2025-03-03 18:26:55,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332246206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:55,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:55,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:26:55,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548459582] [2025-03-03 18:26:55,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:55,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:26:55,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:55,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:26:55,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:26:55,755 INFO L87 Difference]: Start difference. First operand 5469 states and 7854 transitions. Second operand has 7 states, 7 states have (on average 43.57142857142857) internal successors, (305), 7 states have internal predecessors, (305), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:56,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:56,237 INFO L93 Difference]: Finished difference Result 8989 states and 13001 transitions. [2025-03-03 18:26:56,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:26:56,238 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 43.57142857142857) internal successors, (305), 7 states have internal predecessors, (305), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 312 [2025-03-03 18:26:56,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:56,242 INFO L225 Difference]: With dead ends: 8989 [2025-03-03 18:26:56,242 INFO L226 Difference]: Without dead ends: 5469 [2025-03-03 18:26:56,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:26:56,245 INFO L435 NwaCegarLoop]: 907 mSDtfsCounter, 1437 mSDsluCounter, 2643 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1437 SdHoareTripleChecker+Valid, 3550 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:56,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1437 Valid, 3550 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:26:56,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5469 states. [2025-03-03 18:26:56,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5469 to 5469. [2025-03-03 18:26:56,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5469 states, 5436 states have (on average 1.4260485651214128) internal successors, (7752), 5436 states have internal predecessors, (7752), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 18:26:56,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5469 states to 5469 states and 7814 transitions. [2025-03-03 18:26:56,284 INFO L78 Accepts]: Start accepts. Automaton has 5469 states and 7814 transitions. Word has length 312 [2025-03-03 18:26:56,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:56,284 INFO L471 AbstractCegarLoop]: Abstraction has 5469 states and 7814 transitions. [2025-03-03 18:26:56,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.57142857142857) internal successors, (305), 7 states have internal predecessors, (305), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:56,284 INFO L276 IsEmpty]: Start isEmpty. Operand 5469 states and 7814 transitions. [2025-03-03 18:26:56,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-03 18:26:56,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:56,287 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:56,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-03 18:26:56,288 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:56,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:56,288 INFO L85 PathProgramCache]: Analyzing trace with hash -230404343, now seen corresponding path program 1 times [2025-03-03 18:26:56,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:56,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116753050] [2025-03-03 18:26:56,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:56,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:56,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-03 18:26:56,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-03 18:26:56,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:56,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:56,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:56,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:56,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116753050] [2025-03-03 18:26:56,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116753050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:56,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:56,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:26:56,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97286401] [2025-03-03 18:26:56,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:56,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:26:56,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:56,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:26:56,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:26:56,716 INFO L87 Difference]: Start difference. First operand 5469 states and 7814 transitions. Second operand has 6 states, 6 states have (on average 51.0) internal successors, (306), 6 states have internal predecessors, (306), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:57,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:57,214 INFO L93 Difference]: Finished difference Result 9252 states and 13337 transitions. [2025-03-03 18:26:57,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:26:57,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.0) internal successors, (306), 6 states have internal predecessors, (306), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 313 [2025-03-03 18:26:57,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:57,220 INFO L225 Difference]: With dead ends: 9252 [2025-03-03 18:26:57,220 INFO L226 Difference]: Without dead ends: 6799 [2025-03-03 18:26:57,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:26:57,223 INFO L435 NwaCegarLoop]: 969 mSDtfsCounter, 1205 mSDsluCounter, 3891 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 4860 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:57,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 4860 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:26:57,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6799 states. [2025-03-03 18:26:57,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6799 to 5549. [2025-03-03 18:26:57,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5549 states, 5516 states have (on average 1.4253081943437274) internal successors, (7862), 5516 states have internal predecessors, (7862), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 18:26:57,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5549 states to 5549 states and 7924 transitions. [2025-03-03 18:26:57,266 INFO L78 Accepts]: Start accepts. Automaton has 5549 states and 7924 transitions. Word has length 313 [2025-03-03 18:26:57,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:57,266 INFO L471 AbstractCegarLoop]: Abstraction has 5549 states and 7924 transitions. [2025-03-03 18:26:57,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.0) internal successors, (306), 6 states have internal predecessors, (306), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:57,266 INFO L276 IsEmpty]: Start isEmpty. Operand 5549 states and 7924 transitions. [2025-03-03 18:26:57,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-03 18:26:57,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:57,270 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:57,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-03 18:26:57,270 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:57,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:57,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1665193613, now seen corresponding path program 1 times [2025-03-03 18:26:57,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:57,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049695173] [2025-03-03 18:26:57,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:57,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:57,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-03 18:26:57,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-03 18:26:57,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:57,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:57,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:57,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:57,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049695173] [2025-03-03 18:26:57,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049695173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:57,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:57,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:26:57,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849934938] [2025-03-03 18:26:57,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:57,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:26:57,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:57,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:26:57,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:26:57,788 INFO L87 Difference]: Start difference. First operand 5549 states and 7924 transitions. Second operand has 7 states, 7 states have (on average 43.714285714285715) internal successors, (306), 7 states have internal predecessors, (306), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:58,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:58,259 INFO L93 Difference]: Finished difference Result 8957 states and 12893 transitions. [2025-03-03 18:26:58,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:26:58,260 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 43.714285714285715) internal successors, (306), 7 states have internal predecessors, (306), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 313 [2025-03-03 18:26:58,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:58,265 INFO L225 Difference]: With dead ends: 8957 [2025-03-03 18:26:58,265 INFO L226 Difference]: Without dead ends: 5549 [2025-03-03 18:26:58,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:26:58,269 INFO L435 NwaCegarLoop]: 906 mSDtfsCounter, 2318 mSDsluCounter, 2617 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2318 SdHoareTripleChecker+Valid, 3523 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:58,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2318 Valid, 3523 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:26:58,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5549 states. [2025-03-03 18:26:58,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5549 to 5549. [2025-03-03 18:26:58,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5549 states, 5516 states have (on average 1.4216823785351704) internal successors, (7842), 5516 states have internal predecessors, (7842), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 18:26:58,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5549 states to 5549 states and 7904 transitions. [2025-03-03 18:26:58,315 INFO L78 Accepts]: Start accepts. Automaton has 5549 states and 7904 transitions. Word has length 313 [2025-03-03 18:26:58,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:58,315 INFO L471 AbstractCegarLoop]: Abstraction has 5549 states and 7904 transitions. [2025-03-03 18:26:58,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.714285714285715) internal successors, (306), 7 states have internal predecessors, (306), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:58,315 INFO L276 IsEmpty]: Start isEmpty. Operand 5549 states and 7904 transitions. [2025-03-03 18:26:58,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-03-03 18:26:58,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:58,319 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:58,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-03 18:26:58,319 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:58,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:58,319 INFO L85 PathProgramCache]: Analyzing trace with hash -874579059, now seen corresponding path program 1 times [2025-03-03 18:26:58,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:58,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226187630] [2025-03-03 18:26:58,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:58,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:58,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-03-03 18:26:58,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-03-03 18:26:58,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:58,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:58,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:58,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:58,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226187630] [2025-03-03 18:26:58,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226187630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:58,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:58,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:26:58,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848464779] [2025-03-03 18:26:58,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:58,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:26:58,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:58,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:26:58,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:26:58,711 INFO L87 Difference]: Start difference. First operand 5549 states and 7904 transitions. Second operand has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:59,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:26:59,211 INFO L93 Difference]: Finished difference Result 9204 states and 13229 transitions. [2025-03-03 18:26:59,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:26:59,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 314 [2025-03-03 18:26:59,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:26:59,217 INFO L225 Difference]: With dead ends: 9204 [2025-03-03 18:26:59,217 INFO L226 Difference]: Without dead ends: 6799 [2025-03-03 18:26:59,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:26:59,220 INFO L435 NwaCegarLoop]: 968 mSDtfsCounter, 1198 mSDsluCounter, 3887 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 4855 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:26:59,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 4855 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:26:59,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6799 states. [2025-03-03 18:26:59,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6799 to 5629. [2025-03-03 18:26:59,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5629 states, 5596 states have (on average 1.4210150107219441) internal successors, (7952), 5596 states have internal predecessors, (7952), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 18:26:59,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5629 states to 5629 states and 8014 transitions. [2025-03-03 18:26:59,267 INFO L78 Accepts]: Start accepts. Automaton has 5629 states and 8014 transitions. Word has length 314 [2025-03-03 18:26:59,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:26:59,267 INFO L471 AbstractCegarLoop]: Abstraction has 5629 states and 8014 transitions. [2025-03-03 18:26:59,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:26:59,267 INFO L276 IsEmpty]: Start isEmpty. Operand 5629 states and 8014 transitions. [2025-03-03 18:26:59,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-03-03 18:26:59,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:26:59,271 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:26:59,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-03 18:26:59,271 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:26:59,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:26:59,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1996896267, now seen corresponding path program 1 times [2025-03-03 18:26:59,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:26:59,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91621275] [2025-03-03 18:26:59,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:26:59,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:26:59,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-03-03 18:26:59,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-03-03 18:26:59,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:26:59,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:26:59,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:26:59,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:26:59,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91621275] [2025-03-03 18:26:59,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91621275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:26:59,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:26:59,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:26:59,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789841742] [2025-03-03 18:26:59,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:26:59,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:26:59,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:26:59,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:26:59,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:26:59,690 INFO L87 Difference]: Start difference. First operand 5629 states and 8014 transitions. Second operand has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:27:00,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:00,177 INFO L93 Difference]: Finished difference Result 8684 states and 12411 transitions. [2025-03-03 18:27:00,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:27:00,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 314 [2025-03-03 18:27:00,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:00,184 INFO L225 Difference]: With dead ends: 8684 [2025-03-03 18:27:00,184 INFO L226 Difference]: Without dead ends: 6882 [2025-03-03 18:27:00,186 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-03 18:27:00,186 INFO L435 NwaCegarLoop]: 973 mSDtfsCounter, 599 mSDsluCounter, 3884 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 4857 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:00,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 4857 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:27:00,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6882 states. [2025-03-03 18:27:00,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6882 to 6532. [2025-03-03 18:27:00,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6532 states, 6496 states have (on average 1.4190270935960592) internal successors, (9218), 6496 states have internal predecessors, (9218), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-03 18:27:00,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6532 states to 6532 states and 9286 transitions. [2025-03-03 18:27:00,236 INFO L78 Accepts]: Start accepts. Automaton has 6532 states and 9286 transitions. Word has length 314 [2025-03-03 18:27:00,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:00,236 INFO L471 AbstractCegarLoop]: Abstraction has 6532 states and 9286 transitions. [2025-03-03 18:27:00,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.166666666666664) internal successors, (307), 6 states have internal predecessors, (307), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:27:00,236 INFO L276 IsEmpty]: Start isEmpty. Operand 6532 states and 9286 transitions. [2025-03-03 18:27:00,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-03-03 18:27:00,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:00,240 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:27:00,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-03 18:27:00,240 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:00,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:00,240 INFO L85 PathProgramCache]: Analyzing trace with hash -100713512, now seen corresponding path program 1 times [2025-03-03 18:27:00,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:00,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839735976] [2025-03-03 18:27:00,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:00,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:00,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-03 18:27:00,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-03 18:27:00,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:00,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:27:00,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:27:00,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839735976] [2025-03-03 18:27:00,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839735976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:27:00,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:27:00,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:27:00,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231279391] [2025-03-03 18:27:00,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:27:00,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:27:00,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:27:00,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:27:00,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:27:00,492 INFO L87 Difference]: Start difference. First operand 6532 states and 9286 transitions. Second operand has 5 states, 5 states have (on average 61.6) internal successors, (308), 5 states have internal predecessors, (308), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:27:00,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:00,803 INFO L93 Difference]: Finished difference Result 8346 states and 11901 transitions. [2025-03-03 18:27:00,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:27:00,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 61.6) internal successors, (308), 5 states have internal predecessors, (308), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 315 [2025-03-03 18:27:00,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:00,809 INFO L225 Difference]: With dead ends: 8346 [2025-03-03 18:27:00,809 INFO L226 Difference]: Without dead ends: 6544 [2025-03-03 18:27:00,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:27:00,812 INFO L435 NwaCegarLoop]: 995 mSDtfsCounter, 2 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3970 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:00,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3970 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:27:00,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6544 states. [2025-03-03 18:27:00,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6544 to 6542. [2025-03-03 18:27:00,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6542 states, 6506 states have (on average 1.4186904395942208) internal successors, (9230), 6506 states have internal predecessors, (9230), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-03 18:27:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 9298 transitions. [2025-03-03 18:27:00,862 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 9298 transitions. Word has length 315 [2025-03-03 18:27:00,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:00,862 INFO L471 AbstractCegarLoop]: Abstraction has 6542 states and 9298 transitions. [2025-03-03 18:27:00,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.6) internal successors, (308), 5 states have internal predecessors, (308), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:27:00,862 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 9298 transitions. [2025-03-03 18:27:00,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-03-03 18:27:00,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:00,866 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:27:00,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-03 18:27:00,866 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:00,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:00,867 INFO L85 PathProgramCache]: Analyzing trace with hash -985683489, now seen corresponding path program 1 times [2025-03-03 18:27:00,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:00,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332420075] [2025-03-03 18:27:00,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:00,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:00,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-03 18:27:00,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-03 18:27:00,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:00,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:01,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:27:01,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:27:01,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332420075] [2025-03-03 18:27:01,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332420075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:27:01,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:27:01,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:27:01,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664737014] [2025-03-03 18:27:01,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:27:01,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:27:01,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:27:01,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:27:01,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:27:01,120 INFO L87 Difference]: Start difference. First operand 6542 states and 9298 transitions. Second operand has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:27:01,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:01,358 INFO L93 Difference]: Finished difference Result 8384 states and 11949 transitions. [2025-03-03 18:27:01,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:27:01,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 315 [2025-03-03 18:27:01,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:01,364 INFO L225 Difference]: With dead ends: 8384 [2025-03-03 18:27:01,364 INFO L226 Difference]: Without dead ends: 6558 [2025-03-03 18:27:01,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-03 18:27:01,366 INFO L435 NwaCegarLoop]: 997 mSDtfsCounter, 0 mSDsluCounter, 1988 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2985 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:01,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2985 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:27:01,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6558 states. [2025-03-03 18:27:01,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6558 to 6558. [2025-03-03 18:27:01,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6558 states, 6522 states have (on average 1.417969947868752) internal successors, (9248), 6522 states have internal predecessors, (9248), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-03 18:27:01,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6558 states to 6558 states and 9316 transitions. [2025-03-03 18:27:01,413 INFO L78 Accepts]: Start accepts. Automaton has 6558 states and 9316 transitions. Word has length 315 [2025-03-03 18:27:01,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:01,414 INFO L471 AbstractCegarLoop]: Abstraction has 6558 states and 9316 transitions. [2025-03-03 18:27:01,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:27:01,414 INFO L276 IsEmpty]: Start isEmpty. Operand 6558 states and 9316 transitions. [2025-03-03 18:27:01,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-03-03 18:27:01,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:01,418 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:27:01,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-03 18:27:01,418 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:01,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:01,418 INFO L85 PathProgramCache]: Analyzing trace with hash 109255659, now seen corresponding path program 1 times [2025-03-03 18:27:01,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:01,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286278766] [2025-03-03 18:27:01,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:01,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:01,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-03 18:27:01,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-03 18:27:01,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:01,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:01,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:27:01,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:27:01,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286278766] [2025-03-03 18:27:01,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286278766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:27:01,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:27:01,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:27:01,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839546665] [2025-03-03 18:27:01,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:27:01,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:27:01,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:27:01,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:27:01,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:27:01,937 INFO L87 Difference]: Start difference. First operand 6558 states and 9316 transitions. Second operand has 7 states, 7 states have (on average 44.0) internal successors, (308), 7 states have internal predecessors, (308), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:27:02,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:02,695 INFO L93 Difference]: Finished difference Result 8798 states and 12559 transitions. [2025-03-03 18:27:02,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:27:02,695 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 44.0) internal successors, (308), 7 states have internal predecessors, (308), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 315 [2025-03-03 18:27:02,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:02,701 INFO L225 Difference]: With dead ends: 8798 [2025-03-03 18:27:02,701 INFO L226 Difference]: Without dead ends: 6984 [2025-03-03 18:27:02,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:27:02,703 INFO L435 NwaCegarLoop]: 1512 mSDtfsCounter, 1782 mSDsluCounter, 5407 mSDsCounter, 0 mSdLazyCounter, 2055 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1784 SdHoareTripleChecker+Valid, 6919 SdHoareTripleChecker+Invalid, 2055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:02,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1784 Valid, 6919 Invalid, 2055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2055 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:27:02,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6984 states. [2025-03-03 18:27:02,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6984 to 6558. [2025-03-03 18:27:02,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6558 states, 6522 states have (on average 1.417969947868752) internal successors, (9248), 6522 states have internal predecessors, (9248), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-03 18:27:02,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6558 states to 6558 states and 9316 transitions. [2025-03-03 18:27:02,760 INFO L78 Accepts]: Start accepts. Automaton has 6558 states and 9316 transitions. Word has length 315 [2025-03-03 18:27:02,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:02,760 INFO L471 AbstractCegarLoop]: Abstraction has 6558 states and 9316 transitions. [2025-03-03 18:27:02,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 44.0) internal successors, (308), 7 states have internal predecessors, (308), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:27:02,760 INFO L276 IsEmpty]: Start isEmpty. Operand 6558 states and 9316 transitions. [2025-03-03 18:27:02,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-03-03 18:27:02,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:02,765 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:27:02,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-03 18:27:02,765 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:02,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:02,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1196328978, now seen corresponding path program 1 times [2025-03-03 18:27:02,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:02,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157711892] [2025-03-03 18:27:02,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:02,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:02,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-03 18:27:02,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-03 18:27:02,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:02,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:03,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:27:03,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:27:03,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157711892] [2025-03-03 18:27:03,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157711892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:27:03,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:27:03,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:27:03,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153759017] [2025-03-03 18:27:03,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:27:03,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:27:03,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:27:03,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:27:03,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:27:03,305 INFO L87 Difference]: Start difference. First operand 6558 states and 9316 transitions. Second operand has 7 states, 7 states have (on average 44.0) internal successors, (308), 7 states have internal predecessors, (308), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:27:03,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:03,967 INFO L93 Difference]: Finished difference Result 8750 states and 12493 transitions. [2025-03-03 18:27:03,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:27:03,967 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 44.0) internal successors, (308), 7 states have internal predecessors, (308), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 315 [2025-03-03 18:27:03,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:03,973 INFO L225 Difference]: With dead ends: 8750 [2025-03-03 18:27:03,973 INFO L226 Difference]: Without dead ends: 6936 [2025-03-03 18:27:03,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:27:03,976 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 2300 mSDsluCounter, 3600 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2302 SdHoareTripleChecker+Valid, 4511 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:03,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2302 Valid, 4511 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1417 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:27:03,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6936 states. [2025-03-03 18:27:04,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6936 to 5671. [2025-03-03 18:27:04,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5671 states, 5638 states have (on average 1.4196523589925505) internal successors, (8004), 5638 states have internal predecessors, (8004), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 18:27:04,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5671 states to 5671 states and 8066 transitions. [2025-03-03 18:27:04,029 INFO L78 Accepts]: Start accepts. Automaton has 5671 states and 8066 transitions. Word has length 315 [2025-03-03 18:27:04,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:04,030 INFO L471 AbstractCegarLoop]: Abstraction has 5671 states and 8066 transitions. [2025-03-03 18:27:04,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 44.0) internal successors, (308), 7 states have internal predecessors, (308), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:27:04,030 INFO L276 IsEmpty]: Start isEmpty. Operand 5671 states and 8066 transitions. [2025-03-03 18:27:04,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-03-03 18:27:04,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:04,034 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:27:04,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-03 18:27:04,034 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:04,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:04,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1233079417, now seen corresponding path program 1 times [2025-03-03 18:27:04,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:04,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522584405] [2025-03-03 18:27:04,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:04,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:04,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-03 18:27:04,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-03 18:27:04,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:04,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:04,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:27:04,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:27:04,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522584405] [2025-03-03 18:27:04,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522584405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:27:04,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:27:04,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 18:27:04,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398300061] [2025-03-03 18:27:04,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:27:04,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 18:27:04,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:27:04,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 18:27:04,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:27:04,901 INFO L87 Difference]: Start difference. First operand 5671 states and 8066 transitions. Second operand has 12 states, 12 states have (on average 25.75) internal successors, (309), 12 states have internal predecessors, (309), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 18:27:06,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:06,401 INFO L93 Difference]: Finished difference Result 10605 states and 15160 transitions. [2025-03-03 18:27:06,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 18:27:06,401 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 25.75) internal successors, (309), 12 states have internal predecessors, (309), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 316 [2025-03-03 18:27:06,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:06,407 INFO L225 Difference]: With dead ends: 10605 [2025-03-03 18:27:06,407 INFO L226 Difference]: Without dead ends: 7783 [2025-03-03 18:27:06,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-03-03 18:27:06,410 INFO L435 NwaCegarLoop]: 1562 mSDtfsCounter, 2505 mSDsluCounter, 11761 mSDsCounter, 0 mSdLazyCounter, 3875 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2506 SdHoareTripleChecker+Valid, 13323 SdHoareTripleChecker+Invalid, 3878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:06,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2506 Valid, 13323 Invalid, 3878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3875 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 18:27:06,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7783 states. [2025-03-03 18:27:06,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7783 to 6011. [2025-03-03 18:27:06,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6011 states, 5976 states have (on average 1.4133199464524766) internal successors, (8446), 5976 states have internal predecessors, (8446), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 18:27:06,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6011 states to 6011 states and 8512 transitions. [2025-03-03 18:27:06,459 INFO L78 Accepts]: Start accepts. Automaton has 6011 states and 8512 transitions. Word has length 316 [2025-03-03 18:27:06,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:06,459 INFO L471 AbstractCegarLoop]: Abstraction has 6011 states and 8512 transitions. [2025-03-03 18:27:06,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 25.75) internal successors, (309), 12 states have internal predecessors, (309), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 18:27:06,459 INFO L276 IsEmpty]: Start isEmpty. Operand 6011 states and 8512 transitions. [2025-03-03 18:27:06,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-03-03 18:27:06,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:06,463 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:27:06,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-03 18:27:06,463 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:06,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:06,463 INFO L85 PathProgramCache]: Analyzing trace with hash -797576742, now seen corresponding path program 1 times [2025-03-03 18:27:06,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:06,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970622248] [2025-03-03 18:27:06,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:06,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:06,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-03 18:27:06,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-03 18:27:06,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:06,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:06,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:27:06,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:27:06,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970622248] [2025-03-03 18:27:06,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970622248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:27:06,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:27:06,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:27:06,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861271100] [2025-03-03 18:27:06,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:27:06,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:27:06,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:27:06,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:27:06,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:27:06,891 INFO L87 Difference]: Start difference. First operand 6011 states and 8512 transitions. Second operand has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:27:07,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:27:07,376 INFO L93 Difference]: Finished difference Result 9266 states and 13164 transitions. [2025-03-03 18:27:07,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:27:07,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 316 [2025-03-03 18:27:07,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:27:07,383 INFO L225 Difference]: With dead ends: 9266 [2025-03-03 18:27:07,383 INFO L226 Difference]: Without dead ends: 7288 [2025-03-03 18:27:07,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:27:07,386 INFO L435 NwaCegarLoop]: 973 mSDtfsCounter, 589 mSDsluCounter, 3884 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 4857 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:27:07,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 4857 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:27:07,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7288 states. [2025-03-03 18:27:07,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7288 to 6954. [2025-03-03 18:27:07,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6954 states, 6916 states have (on average 1.4109311740890689) internal successors, (9758), 6916 states have internal predecessors, (9758), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 18:27:07,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6954 states to 6954 states and 9830 transitions. [2025-03-03 18:27:07,450 INFO L78 Accepts]: Start accepts. Automaton has 6954 states and 9830 transitions. Word has length 316 [2025-03-03 18:27:07,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:27:07,450 INFO L471 AbstractCegarLoop]: Abstraction has 6954 states and 9830 transitions. [2025-03-03 18:27:07,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 18:27:07,450 INFO L276 IsEmpty]: Start isEmpty. Operand 6954 states and 9830 transitions. [2025-03-03 18:27:07,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-03-03 18:27:07,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:27:07,454 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:27:07,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-03 18:27:07,455 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:27:07,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:27:07,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1414317149, now seen corresponding path program 1 times [2025-03-03 18:27:07,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:27:07,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718065263] [2025-03-03 18:27:07,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:27:07,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:27:07,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-03-03 18:27:07,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-03-03 18:27:07,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:27:07,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:27:07,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 18:27:07,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:27:07,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718065263] [2025-03-03 18:27:07,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718065263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:27:07,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:27:07,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:27:07,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731143890] [2025-03-03 18:27:07,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:27:07,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:27:07,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:27:07,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:27:07,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:27:07,861 INFO L87 Difference]: Start difference. First operand 6954 states and 9830 transitions. Second operand has 6 states, 6 states have (on average 51.666666666666664) internal successors, (310), 6 states have internal predecessors, (310), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)