./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 fc3dd6a87fcbbda92d2ef86eac2f1110715a91bf4cd8be375753a9611c0b48d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 22:55:59,670 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 22:55:59,710 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 22:55:59,719 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 22:55:59,719 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 22:55:59,739 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 22:55:59,740 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 22:55:59,740 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 22:55:59,740 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 22:55:59,740 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 22:55:59,741 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 22:55:59,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 22:55:59,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 22:55:59,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 22:55:59,741 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 22:55:59,741 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 22:55:59,741 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 22:55:59,741 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 22:55:59,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 22:55:59,742 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 22:55:59,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 22:55:59,742 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 22:55:59,742 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 22:55:59,742 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 22:55:59,742 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 22:55:59,742 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 22:55:59,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 22:55:59,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 22:55:59,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 22:55:59,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:55:59,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 22:55:59,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 22:55:59,743 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 22:55:59,743 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 22:55:59,744 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 22:55:59,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 22:55:59,744 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 22:55:59,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 22:55:59,744 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 22:55:59,744 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 22:55:59,744 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-jdk21/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 -> fc3dd6a87fcbbda92d2ef86eac2f1110715a91bf4cd8be375753a9611c0b48d5 [2025-02-07 22:56:00,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 22:56:00,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 22:56:00,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 22:56:00,043 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 22:56:00,043 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 22:56:00,044 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c [2025-02-07 22:56:01,165 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15ea87cb1/728cf73e1752465e8491375696603650/FLAGc573e415c [2025-02-07 22:56:01,445 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 22:56:01,448 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c [2025-02-07 22:56:01,460 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15ea87cb1/728cf73e1752465e8491375696603650/FLAGc573e415c [2025-02-07 22:56:01,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15ea87cb1/728cf73e1752465e8491375696603650 [2025-02-07 22:56:01,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 22:56:01,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 22:56:01,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 22:56:01,486 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 22:56:01,491 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 22:56:01,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:56:01" (1/1) ... [2025-02-07 22:56:01,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43a133c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:01, skipping insertion in model container [2025-02-07 22:56:01,492 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:56:01" (1/1) ... [2025-02-07 22:56:01,522 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 22:56:01,634 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c[1280,1293] [2025-02-07 22:56:01,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:56:01,781 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 22:56:01,788 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c[1280,1293] [2025-02-07 22:56:01,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:56:01,916 INFO L204 MainTranslator]: Completed translation [2025-02-07 22:56:01,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:01 WrapperNode [2025-02-07 22:56:01,917 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 22:56:01,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 22:56:01,918 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 22:56:01,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 22:56:01,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:01" (1/1) ... [2025-02-07 22:56:01,962 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:01" (1/1) ... [2025-02-07 22:56:02,128 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1976 [2025-02-07 22:56:02,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 22:56:02,129 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 22:56:02,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 22:56:02,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 22:56:02,135 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:01" (1/1) ... [2025-02-07 22:56:02,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:01" (1/1) ... [2025-02-07 22:56:02,152 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:01" (1/1) ... [2025-02-07 22:56:02,208 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-02-07 22:56:02,208 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:01" (1/1) ... [2025-02-07 22:56:02,208 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:01" (1/1) ... [2025-02-07 22:56:02,256 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:01" (1/1) ... [2025-02-07 22:56:02,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:01" (1/1) ... [2025-02-07 22:56:02,280 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:01" (1/1) ... [2025-02-07 22:56:02,292 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:01" (1/1) ... [2025-02-07 22:56:02,321 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 22:56:02,323 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 22:56:02,323 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 22:56:02,323 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 22:56:02,324 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:01" (1/1) ... [2025-02-07 22:56:02,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:56:02,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:56:02,354 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 22:56:02,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 22:56:02,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 22:56:02,375 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 22:56:02,375 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 22:56:02,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 22:56:02,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 22:56:02,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 22:56:02,592 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 22:56:02,593 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 22:56:04,159 INFO L? ?]: Removed 1089 outVars from TransFormulas that were not future-live. [2025-02-07 22:56:04,159 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 22:56:04,256 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 22:56:04,256 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 22:56:04,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:56:04 BoogieIcfgContainer [2025-02-07 22:56:04,257 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 22:56:04,258 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 22:56:04,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 22:56:04,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 22:56:04,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:56:01" (1/3) ... [2025-02-07 22:56:04,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f1dad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:56:04, skipping insertion in model container [2025-02-07 22:56:04,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:56:01" (2/3) ... [2025-02-07 22:56:04,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f1dad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:56:04, skipping insertion in model container [2025-02-07 22:56:04,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:56:04" (3/3) ... [2025-02-07 22:56:04,264 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c [2025-02-07 22:56:04,273 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 22:56:04,274 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.circular_pointer_top_w32_d16_e0.c that has 2 procedures, 550 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 22:56:04,313 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 22:56:04,320 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;@6583bfd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 22:56:04,320 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 22:56:04,324 INFO L276 IsEmpty]: Start isEmpty. Operand has 550 states, 544 states have (on average 1.4963235294117647) internal successors, (814), 545 states have internal predecessors, (814), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:04,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-07 22:56:04,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:04,333 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:04,333 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:04,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:04,336 INFO L85 PathProgramCache]: Analyzing trace with hash 75293469, now seen corresponding path program 1 times [2025-02-07 22:56:04,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:04,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946522660] [2025-02-07 22:56:04,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:04,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:04,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-07 22:56:04,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-07 22:56:04,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:04,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:04,684 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-07 22:56:04,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:04,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946522660] [2025-02-07 22:56:04,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946522660] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:56:04,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524661958] [2025-02-07 22:56:04,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:04,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:56:04,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:56:04,689 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 22:56:04,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 22:56:04,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-07 22:56:05,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-07 22:56:05,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:05,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:05,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-07 22:56:05,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:56:05,036 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-07 22:56:05,036 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:56:05,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524661958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:05,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 22:56:05,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-07 22:56:05,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668898809] [2025-02-07 22:56:05,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:05,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 22:56:05,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:05,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 22:56:05,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 22:56:05,060 INFO L87 Difference]: Start difference. First operand has 550 states, 544 states have (on average 1.4963235294117647) internal successors, (814), 545 states have internal predecessors, (814), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 69.0) internal successors, (138), 2 states have internal predecessors, (138), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:56:05,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:05,252 INFO L93 Difference]: Finished difference Result 997 states and 1491 transitions. [2025-02-07 22:56:05,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 22:56:05,254 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 69.0) internal successors, (138), 2 states have internal predecessors, (138), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 148 [2025-02-07 22:56:05,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:05,261 INFO L225 Difference]: With dead ends: 997 [2025-02-07 22:56:05,261 INFO L226 Difference]: Without dead ends: 548 [2025-02-07 22:56:05,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 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-02-07 22:56:05,265 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:05,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 683 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:05,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-02-07 22:56:05,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-02-07 22:56:05,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 543 states have (on average 1.4917127071823204) internal successors, (810), 543 states have internal predecessors, (810), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:05,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 816 transitions. [2025-02-07 22:56:05,305 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 816 transitions. Word has length 148 [2025-02-07 22:56:05,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:05,306 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 816 transitions. [2025-02-07 22:56:05,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 69.0) internal successors, (138), 2 states have internal predecessors, (138), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:56:05,306 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 816 transitions. [2025-02-07 22:56:05,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-07 22:56:05,313 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:05,313 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:05,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 22:56:05,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-07 22:56:05,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:05,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:05,514 INFO L85 PathProgramCache]: Analyzing trace with hash 361194170, now seen corresponding path program 1 times [2025-02-07 22:56:05,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:05,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396794655] [2025-02-07 22:56:05,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:05,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:05,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-07 22:56:05,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-07 22:56:05,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:05,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:06,414 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:06,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:06,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396794655] [2025-02-07 22:56:06,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396794655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:06,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:06,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:56:06,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078496949] [2025-02-07 22:56:06,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:06,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:56:06,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:06,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:56:06,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:56:06,417 INFO L87 Difference]: Start difference. First operand 548 states and 816 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:06,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:06,718 INFO L93 Difference]: Finished difference Result 552 states and 820 transitions. [2025-02-07 22:56:06,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:06,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 148 [2025-02-07 22:56:06,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:06,721 INFO L225 Difference]: With dead ends: 552 [2025-02-07 22:56:06,721 INFO L226 Difference]: Without dead ends: 550 [2025-02-07 22:56:06,722 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-02-07 22:56:06,722 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 0 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:06,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2038 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:56:06,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-02-07 22:56:06,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2025-02-07 22:56:06,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 545 states have (on average 1.489908256880734) internal successors, (812), 545 states have internal predecessors, (812), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:06,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 818 transitions. [2025-02-07 22:56:06,735 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 818 transitions. Word has length 148 [2025-02-07 22:56:06,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:06,736 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 818 transitions. [2025-02-07 22:56:06,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:06,737 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 818 transitions. [2025-02-07 22:56:06,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-07 22:56:06,738 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:06,738 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:06,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 22:56:06,738 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:06,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:06,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1683202985, now seen corresponding path program 1 times [2025-02-07 22:56:06,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:06,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20216670] [2025-02-07 22:56:06,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:06,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:06,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-07 22:56:06,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-07 22:56:06,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:06,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:07,131 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:07,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:07,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20216670] [2025-02-07 22:56:07,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20216670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:07,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:07,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:07,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006893442] [2025-02-07 22:56:07,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:07,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:07,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:07,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:07,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:07,133 INFO L87 Difference]: Start difference. First operand 550 states and 818 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:07,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:07,750 INFO L93 Difference]: Finished difference Result 1370 states and 2040 transitions. [2025-02-07 22:56:07,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:56:07,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 149 [2025-02-07 22:56:07,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:07,753 INFO L225 Difference]: With dead ends: 1370 [2025-02-07 22:56:07,753 INFO L226 Difference]: Without dead ends: 550 [2025-02-07 22:56:07,755 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-02-07 22:56:07,756 INFO L435 NwaCegarLoop]: 716 mSDtfsCounter, 1618 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1618 SdHoareTripleChecker+Valid, 1964 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:07,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1618 Valid, 1964 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:56:07,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-02-07 22:56:07,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2025-02-07 22:56:07,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 545 states have (on average 1.4880733944954128) internal successors, (811), 545 states have internal predecessors, (811), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 817 transitions. [2025-02-07 22:56:07,768 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 817 transitions. Word has length 149 [2025-02-07 22:56:07,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:07,769 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 817 transitions. [2025-02-07 22:56:07,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:07,769 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 817 transitions. [2025-02-07 22:56:07,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-07 22:56:07,770 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:07,771 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:07,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 22:56:07,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:07,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:07,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1457131840, now seen corresponding path program 1 times [2025-02-07 22:56:07,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:07,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382108977] [2025-02-07 22:56:07,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:07,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:07,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-07 22:56:07,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-07 22:56:07,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:07,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:08,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:08,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:08,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382108977] [2025-02-07 22:56:08,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382108977] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:08,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:08,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:56:08,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645731069] [2025-02-07 22:56:08,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:08,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:56:08,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:08,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:56:08,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:56:08,105 INFO L87 Difference]: Start difference. First operand 550 states and 817 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:08,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:08,333 INFO L93 Difference]: Finished difference Result 1001 states and 1486 transitions. [2025-02-07 22:56:08,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:08,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 150 [2025-02-07 22:56:08,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:08,335 INFO L225 Difference]: With dead ends: 1001 [2025-02-07 22:56:08,335 INFO L226 Difference]: Without dead ends: 552 [2025-02-07 22:56:08,336 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-02-07 22:56:08,338 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 0 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2032 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:08,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2032 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:08,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-07 22:56:08,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-02-07 22:56:08,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4862888482632541) internal successors, (813), 547 states have internal predecessors, (813), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:08,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 819 transitions. [2025-02-07 22:56:08,348 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 819 transitions. Word has length 150 [2025-02-07 22:56:08,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:08,348 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 819 transitions. [2025-02-07 22:56:08,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:08,349 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 819 transitions. [2025-02-07 22:56:08,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-07 22:56:08,350 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:08,350 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:08,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 22:56:08,350 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:08,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:08,350 INFO L85 PathProgramCache]: Analyzing trace with hash -142043508, now seen corresponding path program 1 times [2025-02-07 22:56:08,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:08,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614263734] [2025-02-07 22:56:08,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:08,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:08,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-07 22:56:08,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-07 22:56:08,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:08,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:08,793 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:08,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:08,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614263734] [2025-02-07 22:56:08,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614263734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:08,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:08,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:56:08,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255652562] [2025-02-07 22:56:08,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:08,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:56:08,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:08,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:56:08,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:56:08,794 INFO L87 Difference]: Start difference. First operand 552 states and 819 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:09,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:09,078 INFO L93 Difference]: Finished difference Result 1003 states and 1487 transitions. [2025-02-07 22:56:09,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:09,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 151 [2025-02-07 22:56:09,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:09,081 INFO L225 Difference]: With dead ends: 1003 [2025-02-07 22:56:09,081 INFO L226 Difference]: Without dead ends: 552 [2025-02-07 22:56:09,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:09,082 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 691 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:09,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1233 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:56:09,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-07 22:56:09,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-02-07 22:56:09,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.482632541133455) internal successors, (811), 547 states have internal predecessors, (811), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:09,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 817 transitions. [2025-02-07 22:56:09,093 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 817 transitions. Word has length 151 [2025-02-07 22:56:09,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:09,094 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 817 transitions. [2025-02-07 22:56:09,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:09,094 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 817 transitions. [2025-02-07 22:56:09,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-07 22:56:09,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:09,095 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:09,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 22:56:09,095 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:09,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:09,095 INFO L85 PathProgramCache]: Analyzing trace with hash -775926310, now seen corresponding path program 1 times [2025-02-07 22:56:09,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:09,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252124909] [2025-02-07 22:56:09,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:09,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:09,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-07 22:56:09,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-07 22:56:09,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:09,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:09,378 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:09,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:09,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252124909] [2025-02-07 22:56:09,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252124909] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:09,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:09,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:09,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185210798] [2025-02-07 22:56:09,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:09,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:09,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:09,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:09,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:09,381 INFO L87 Difference]: Start difference. First operand 552 states and 817 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:09,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:09,682 INFO L93 Difference]: Finished difference Result 1011 states and 1494 transitions. [2025-02-07 22:56:09,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:56:09,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 153 [2025-02-07 22:56:09,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:09,684 INFO L225 Difference]: With dead ends: 1011 [2025-02-07 22:56:09,685 INFO L226 Difference]: Without dead ends: 552 [2025-02-07 22:56:09,685 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-02-07 22:56:09,685 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 706 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:09,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 1961 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:56:09,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-07 22:56:09,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-02-07 22:56:09,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4808043875685557) internal successors, (810), 547 states have internal predecessors, (810), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:09,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 816 transitions. [2025-02-07 22:56:09,705 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 816 transitions. Word has length 153 [2025-02-07 22:56:09,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:09,708 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 816 transitions. [2025-02-07 22:56:09,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:09,708 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 816 transitions. [2025-02-07 22:56:09,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-07 22:56:09,709 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:09,709 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:09,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 22:56:09,709 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:09,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:09,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1472752064, now seen corresponding path program 1 times [2025-02-07 22:56:09,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:09,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300473474] [2025-02-07 22:56:09,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:09,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:09,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-07 22:56:09,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-07 22:56:09,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:09,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:09,961 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:09,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:09,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300473474] [2025-02-07 22:56:09,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300473474] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:09,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:09,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:09,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343421206] [2025-02-07 22:56:09,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:09,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:09,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:09,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:09,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:09,963 INFO L87 Difference]: Start difference. First operand 552 states and 816 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:10,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:10,268 INFO L93 Difference]: Finished difference Result 1003 states and 1481 transitions. [2025-02-07 22:56:10,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:10,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 154 [2025-02-07 22:56:10,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:10,271 INFO L225 Difference]: With dead ends: 1003 [2025-02-07 22:56:10,271 INFO L226 Difference]: Without dead ends: 552 [2025-02-07 22:56:10,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:10,274 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 801 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:10,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 1239 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:56:10,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-07 22:56:10,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-02-07 22:56:10,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4789762340036563) internal successors, (809), 547 states have internal predecessors, (809), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:10,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 815 transitions. [2025-02-07 22:56:10,289 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 815 transitions. Word has length 154 [2025-02-07 22:56:10,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:10,290 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 815 transitions. [2025-02-07 22:56:10,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:10,290 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 815 transitions. [2025-02-07 22:56:10,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-07 22:56:10,291 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:10,291 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:10,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 22:56:10,291 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:10,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:10,292 INFO L85 PathProgramCache]: Analyzing trace with hash -262165259, now seen corresponding path program 1 times [2025-02-07 22:56:10,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:10,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956237732] [2025-02-07 22:56:10,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:10,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:10,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-07 22:56:10,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-07 22:56:10,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:10,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:10,584 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:10,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:10,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956237732] [2025-02-07 22:56:10,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956237732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:10,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:10,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:10,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390590460] [2025-02-07 22:56:10,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:10,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:10,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:10,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:10,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:10,585 INFO L87 Difference]: Start difference. First operand 552 states and 815 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:10,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:10,866 INFO L93 Difference]: Finished difference Result 1003 states and 1479 transitions. [2025-02-07 22:56:10,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:10,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 155 [2025-02-07 22:56:10,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:10,868 INFO L225 Difference]: With dead ends: 1003 [2025-02-07 22:56:10,869 INFO L226 Difference]: Without dead ends: 552 [2025-02-07 22:56:10,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:10,872 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 797 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:10,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 1239 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:56:10,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-07 22:56:10,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-02-07 22:56:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.477148080438757) internal successors, (808), 547 states have internal predecessors, (808), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:10,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 814 transitions. [2025-02-07 22:56:10,886 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 814 transitions. Word has length 155 [2025-02-07 22:56:10,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:10,886 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 814 transitions. [2025-02-07 22:56:10,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:10,887 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 814 transitions. [2025-02-07 22:56:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-07 22:56:10,891 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:10,892 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:10,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 22:56:10,892 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:10,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:10,892 INFO L85 PathProgramCache]: Analyzing trace with hash -2096657029, now seen corresponding path program 1 times [2025-02-07 22:56:10,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:10,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409286943] [2025-02-07 22:56:10,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:10,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:10,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-07 22:56:10,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-07 22:56:10,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:10,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:11,173 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:11,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:11,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409286943] [2025-02-07 22:56:11,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409286943] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:11,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:11,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:11,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111112523] [2025-02-07 22:56:11,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:11,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:11,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:11,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:11,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:11,175 INFO L87 Difference]: Start difference. First operand 552 states and 814 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:11,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:11,468 INFO L93 Difference]: Finished difference Result 1003 states and 1477 transitions. [2025-02-07 22:56:11,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:11,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 156 [2025-02-07 22:56:11,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:11,471 INFO L225 Difference]: With dead ends: 1003 [2025-02-07 22:56:11,471 INFO L226 Difference]: Without dead ends: 552 [2025-02-07 22:56:11,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:11,472 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 1477 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:11,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1233 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:56:11,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-07 22:56:11,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-02-07 22:56:11,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4753199268738575) internal successors, (807), 547 states have internal predecessors, (807), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:11,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 813 transitions. [2025-02-07 22:56:11,484 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 813 transitions. Word has length 156 [2025-02-07 22:56:11,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:11,485 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 813 transitions. [2025-02-07 22:56:11,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:11,485 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 813 transitions. [2025-02-07 22:56:11,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-07 22:56:11,486 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:11,486 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:11,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 22:56:11,487 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:11,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:11,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1696266864, now seen corresponding path program 1 times [2025-02-07 22:56:11,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:11,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796918477] [2025-02-07 22:56:11,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:11,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:11,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-07 22:56:11,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-07 22:56:11,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:11,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:11,754 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:11,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:11,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796918477] [2025-02-07 22:56:11,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796918477] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:11,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:11,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:11,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478473429] [2025-02-07 22:56:11,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:11,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:11,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:11,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:11,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:11,756 INFO L87 Difference]: Start difference. First operand 552 states and 813 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:12,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:12,035 INFO L93 Difference]: Finished difference Result 1003 states and 1475 transitions. [2025-02-07 22:56:12,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:12,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 157 [2025-02-07 22:56:12,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:12,038 INFO L225 Difference]: With dead ends: 1003 [2025-02-07 22:56:12,038 INFO L226 Difference]: Without dead ends: 552 [2025-02-07 22:56:12,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:12,039 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 1461 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:12,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 1233 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:56:12,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-07 22:56:12,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-02-07 22:56:12,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4734917733089579) internal successors, (806), 547 states have internal predecessors, (806), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:12,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 812 transitions. [2025-02-07 22:56:12,049 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 812 transitions. Word has length 157 [2025-02-07 22:56:12,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:12,050 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 812 transitions. [2025-02-07 22:56:12,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:12,050 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 812 transitions. [2025-02-07 22:56:12,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-07 22:56:12,051 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:12,051 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:12,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 22:56:12,051 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:12,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:12,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1045437835, now seen corresponding path program 1 times [2025-02-07 22:56:12,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:12,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89561089] [2025-02-07 22:56:12,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:12,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:12,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-07 22:56:12,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-07 22:56:12,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:12,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:12,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:12,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89561089] [2025-02-07 22:56:12,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89561089] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:12,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:12,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:12,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297989656] [2025-02-07 22:56:12,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:12,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:12,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:12,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:12,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:12,295 INFO L87 Difference]: Start difference. First operand 552 states and 812 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:12,564 INFO L93 Difference]: Finished difference Result 1003 states and 1473 transitions. [2025-02-07 22:56:12,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:12,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 158 [2025-02-07 22:56:12,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:12,567 INFO L225 Difference]: With dead ends: 1003 [2025-02-07 22:56:12,567 INFO L226 Difference]: Without dead ends: 552 [2025-02-07 22:56:12,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:12,568 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 1453 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1456 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:12,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1456 Valid, 1233 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:12,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-07 22:56:12,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-02-07 22:56:12,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4716636197440585) internal successors, (805), 547 states have internal predecessors, (805), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:12,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 811 transitions. [2025-02-07 22:56:12,578 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 811 transitions. Word has length 158 [2025-02-07 22:56:12,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:12,579 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 811 transitions. [2025-02-07 22:56:12,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:12,579 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 811 transitions. [2025-02-07 22:56:12,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-07 22:56:12,580 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:12,580 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:12,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 22:56:12,580 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:12,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:12,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2008085771, now seen corresponding path program 1 times [2025-02-07 22:56:12,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:12,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452109139] [2025-02-07 22:56:12,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:12,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:12,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-07 22:56:12,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-07 22:56:12,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:12,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:12,856 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:12,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:12,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452109139] [2025-02-07 22:56:12,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452109139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:12,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:12,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:12,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629496780] [2025-02-07 22:56:12,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:12,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:12,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:12,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:12,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:12,859 INFO L87 Difference]: Start difference. First operand 552 states and 811 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:13,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:13,130 INFO L93 Difference]: Finished difference Result 1003 states and 1471 transitions. [2025-02-07 22:56:13,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:13,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 159 [2025-02-07 22:56:13,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:13,132 INFO L225 Difference]: With dead ends: 1003 [2025-02-07 22:56:13,132 INFO L226 Difference]: Without dead ends: 552 [2025-02-07 22:56:13,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:13,133 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 777 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:13,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 1239 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:13,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-07 22:56:13,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-02-07 22:56:13,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.469835466179159) internal successors, (804), 547 states have internal predecessors, (804), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:13,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 810 transitions. [2025-02-07 22:56:13,143 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 810 transitions. Word has length 159 [2025-02-07 22:56:13,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:13,143 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 810 transitions. [2025-02-07 22:56:13,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:13,143 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 810 transitions. [2025-02-07 22:56:13,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-07 22:56:13,144 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:13,144 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:13,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 22:56:13,145 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:13,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:13,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1285586224, now seen corresponding path program 1 times [2025-02-07 22:56:13,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:13,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306481550] [2025-02-07 22:56:13,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:13,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:13,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-07 22:56:13,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-07 22:56:13,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:13,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:13,431 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:13,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:13,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306481550] [2025-02-07 22:56:13,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306481550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:13,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:13,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:56:13,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503973086] [2025-02-07 22:56:13,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:13,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:56:13,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:13,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:56:13,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:56:13,433 INFO L87 Difference]: Start difference. First operand 552 states and 810 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:13,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:13,701 INFO L93 Difference]: Finished difference Result 1003 states and 1469 transitions. [2025-02-07 22:56:13,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:13,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 160 [2025-02-07 22:56:13,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:13,703 INFO L225 Difference]: With dead ends: 1003 [2025-02-07 22:56:13,703 INFO L226 Difference]: Without dead ends: 552 [2025-02-07 22:56:13,704 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-02-07 22:56:13,704 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 699 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:13,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 1279 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:13,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-07 22:56:13,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-02-07 22:56:13,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4680073126142597) internal successors, (803), 547 states have internal predecessors, (803), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 809 transitions. [2025-02-07 22:56:13,717 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 809 transitions. Word has length 160 [2025-02-07 22:56:13,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:13,717 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 809 transitions. [2025-02-07 22:56:13,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:13,718 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 809 transitions. [2025-02-07 22:56:13,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-07 22:56:13,719 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:13,719 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:13,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 22:56:13,719 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:13,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:13,720 INFO L85 PathProgramCache]: Analyzing trace with hash 237197206, now seen corresponding path program 1 times [2025-02-07 22:56:13,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:13,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846023280] [2025-02-07 22:56:13,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:13,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:13,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-07 22:56:13,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-07 22:56:13,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:13,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:13,989 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:13,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:13,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846023280] [2025-02-07 22:56:13,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846023280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:13,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:13,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:13,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284117455] [2025-02-07 22:56:13,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:13,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:13,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:13,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:13,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:13,991 INFO L87 Difference]: Start difference. First operand 552 states and 809 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:14,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:14,229 INFO L93 Difference]: Finished difference Result 1003 states and 1467 transitions. [2025-02-07 22:56:14,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:14,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 161 [2025-02-07 22:56:14,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:14,232 INFO L225 Difference]: With dead ends: 1003 [2025-02-07 22:56:14,232 INFO L226 Difference]: Without dead ends: 552 [2025-02-07 22:56:14,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:14,233 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 794 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:14,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 1285 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:14,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-07 22:56:14,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-02-07 22:56:14,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4661791590493602) internal successors, (802), 547 states have internal predecessors, (802), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:14,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 808 transitions. [2025-02-07 22:56:14,242 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 808 transitions. Word has length 161 [2025-02-07 22:56:14,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:14,242 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 808 transitions. [2025-02-07 22:56:14,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:14,243 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 808 transitions. [2025-02-07 22:56:14,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-07 22:56:14,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:14,244 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:14,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 22:56:14,244 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:14,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:14,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1503123413, now seen corresponding path program 1 times [2025-02-07 22:56:14,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:14,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69936728] [2025-02-07 22:56:14,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:14,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:14,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-07 22:56:14,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-07 22:56:14,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:14,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:14,424 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:14,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:14,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69936728] [2025-02-07 22:56:14,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69936728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:14,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:14,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:14,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063832659] [2025-02-07 22:56:14,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:14,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:14,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:14,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:14,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:14,426 INFO L87 Difference]: Start difference. First operand 552 states and 808 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:14,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:14,675 INFO L93 Difference]: Finished difference Result 1003 states and 1465 transitions. [2025-02-07 22:56:14,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:14,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 162 [2025-02-07 22:56:14,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:14,677 INFO L225 Difference]: With dead ends: 1003 [2025-02-07 22:56:14,677 INFO L226 Difference]: Without dead ends: 552 [2025-02-07 22:56:14,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:14,678 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 1479 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:14,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1279 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:14,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-07 22:56:14,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-02-07 22:56:14,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4643510054844606) internal successors, (801), 547 states have internal predecessors, (801), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:14,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 807 transitions. [2025-02-07 22:56:14,688 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 807 transitions. Word has length 162 [2025-02-07 22:56:14,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:14,688 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 807 transitions. [2025-02-07 22:56:14,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:14,689 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 807 transitions. [2025-02-07 22:56:14,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-07 22:56:14,690 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:14,690 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:14,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 22:56:14,690 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:14,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:14,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1758292219, now seen corresponding path program 1 times [2025-02-07 22:56:14,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:14,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765342385] [2025-02-07 22:56:14,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:14,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:14,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-07 22:56:14,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-07 22:56:14,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:14,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:14,883 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:14,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:14,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765342385] [2025-02-07 22:56:14,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765342385] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:14,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:14,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:14,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337485674] [2025-02-07 22:56:14,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:14,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:14,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:14,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:14,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:14,884 INFO L87 Difference]: Start difference. First operand 552 states and 807 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:15,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:15,402 INFO L93 Difference]: Finished difference Result 1003 states and 1463 transitions. [2025-02-07 22:56:15,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:15,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 163 [2025-02-07 22:56:15,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:15,405 INFO L225 Difference]: With dead ends: 1003 [2025-02-07 22:56:15,409 INFO L226 Difference]: Without dead ends: 552 [2025-02-07 22:56:15,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:15,410 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 1471 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:15,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1279 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:56:15,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-07 22:56:15,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-02-07 22:56:15,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4625228519195612) internal successors, (800), 547 states have internal predecessors, (800), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:15,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 806 transitions. [2025-02-07 22:56:15,423 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 806 transitions. Word has length 163 [2025-02-07 22:56:15,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:15,424 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 806 transitions. [2025-02-07 22:56:15,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:15,424 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 806 transitions. [2025-02-07 22:56:15,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-07 22:56:15,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:15,426 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:15,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 22:56:15,426 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:15,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:15,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1945281370, now seen corresponding path program 1 times [2025-02-07 22:56:15,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:15,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255899282] [2025-02-07 22:56:15,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:15,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:15,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-07 22:56:15,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-07 22:56:15,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:15,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:15,695 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:15,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:15,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255899282] [2025-02-07 22:56:15,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255899282] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:15,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:15,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:56:15,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340053181] [2025-02-07 22:56:15,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:15,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:56:15,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:15,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:56:15,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:56:15,698 INFO L87 Difference]: Start difference. First operand 552 states and 806 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:15,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:15,902 INFO L93 Difference]: Finished difference Result 1003 states and 1461 transitions. [2025-02-07 22:56:15,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:15,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 164 [2025-02-07 22:56:15,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:15,905 INFO L225 Difference]: With dead ends: 1003 [2025-02-07 22:56:15,905 INFO L226 Difference]: Without dead ends: 552 [2025-02-07 22:56:15,905 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-02-07 22:56:15,906 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 699 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:15,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 1303 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-07 22:56:15,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-02-07 22:56:15,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4606946983546618) internal successors, (799), 547 states have internal predecessors, (799), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:15,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 805 transitions. [2025-02-07 22:56:15,918 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 805 transitions. Word has length 164 [2025-02-07 22:56:15,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:15,919 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 805 transitions. [2025-02-07 22:56:15,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:15,919 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 805 transitions. [2025-02-07 22:56:15,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 22:56:15,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:15,920 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:15,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 22:56:15,920 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:15,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:15,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1364216150, now seen corresponding path program 1 times [2025-02-07 22:56:15,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:15,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457659889] [2025-02-07 22:56:15,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:15,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:15,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 22:56:15,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 22:56:15,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:15,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:16,141 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:16,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:16,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457659889] [2025-02-07 22:56:16,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457659889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:16,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:16,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:16,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065550903] [2025-02-07 22:56:16,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:16,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:16,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:16,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:16,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:16,146 INFO L87 Difference]: Start difference. First operand 552 states and 805 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:16,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:16,377 INFO L93 Difference]: Finished difference Result 1003 states and 1459 transitions. [2025-02-07 22:56:16,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:16,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 165 [2025-02-07 22:56:16,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:16,379 INFO L225 Difference]: With dead ends: 1003 [2025-02-07 22:56:16,379 INFO L226 Difference]: Without dead ends: 552 [2025-02-07 22:56:16,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:16,380 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 790 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:16,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 1309 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:16,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-07 22:56:16,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-02-07 22:56:16,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4588665447897624) internal successors, (798), 547 states have internal predecessors, (798), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:16,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 804 transitions. [2025-02-07 22:56:16,391 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 804 transitions. Word has length 165 [2025-02-07 22:56:16,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:16,392 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 804 transitions. [2025-02-07 22:56:16,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:16,392 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 804 transitions. [2025-02-07 22:56:16,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-07 22:56:16,393 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:16,393 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:16,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-07 22:56:16,393 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:16,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:16,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1738864097, now seen corresponding path program 1 times [2025-02-07 22:56:16,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:16,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050781910] [2025-02-07 22:56:16,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:16,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:16,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-07 22:56:16,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-07 22:56:16,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:16,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:16,693 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:16,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:16,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050781910] [2025-02-07 22:56:16,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050781910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:16,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:16,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:56:16,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493332170] [2025-02-07 22:56:16,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:16,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:56:16,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:16,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:56:16,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:56:16,696 INFO L87 Difference]: Start difference. First operand 552 states and 804 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:56:16,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:16,914 INFO L93 Difference]: Finished difference Result 1003 states and 1457 transitions. [2025-02-07 22:56:16,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:16,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 166 [2025-02-07 22:56:16,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:16,917 INFO L225 Difference]: With dead ends: 1003 [2025-02-07 22:56:16,917 INFO L226 Difference]: Without dead ends: 552 [2025-02-07 22:56:16,918 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-02-07 22:56:16,918 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 734 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:16,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 1309 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:16,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-07 22:56:16,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-02-07 22:56:16,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4570383912248628) internal successors, (797), 547 states have internal predecessors, (797), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:16,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 803 transitions. [2025-02-07 22:56:16,927 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 803 transitions. Word has length 166 [2025-02-07 22:56:16,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:16,927 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 803 transitions. [2025-02-07 22:56:16,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:56:16,928 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 803 transitions. [2025-02-07 22:56:16,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-07 22:56:16,929 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:16,929 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:16,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-07 22:56:16,929 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:16,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:16,929 INFO L85 PathProgramCache]: Analyzing trace with hash -140520540, now seen corresponding path program 1 times [2025-02-07 22:56:16,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:16,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104089309] [2025-02-07 22:56:16,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:16,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:16,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-07 22:56:17,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-07 22:56:17,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:17,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:17,198 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:17,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:17,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104089309] [2025-02-07 22:56:17,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104089309] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:17,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:17,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:56:17,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634437310] [2025-02-07 22:56:17,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:17,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:56:17,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:17,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:56:17,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:56:17,200 INFO L87 Difference]: Start difference. First operand 552 states and 803 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:56:17,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:17,442 INFO L93 Difference]: Finished difference Result 1003 states and 1455 transitions. [2025-02-07 22:56:17,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:17,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 167 [2025-02-07 22:56:17,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:17,444 INFO L225 Difference]: With dead ends: 1003 [2025-02-07 22:56:17,444 INFO L226 Difference]: Without dead ends: 552 [2025-02-07 22:56:17,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:17,447 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 732 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:17,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 1309 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:17,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-07 22:56:17,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-02-07 22:56:17,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4552102376599634) internal successors, (796), 547 states have internal predecessors, (796), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:17,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 802 transitions. [2025-02-07 22:56:17,459 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 802 transitions. Word has length 167 [2025-02-07 22:56:17,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:17,459 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 802 transitions. [2025-02-07 22:56:17,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:56:17,459 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 802 transitions. [2025-02-07 22:56:17,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-07 22:56:17,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:17,462 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:17,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-07 22:56:17,463 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:17,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:17,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1504434712, now seen corresponding path program 1 times [2025-02-07 22:56:17,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:17,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184931457] [2025-02-07 22:56:17,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:17,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:17,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-07 22:56:17,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-07 22:56:17,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:17,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:17,920 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:17,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:17,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184931457] [2025-02-07 22:56:17,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184931457] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:17,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:17,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:17,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314984443] [2025-02-07 22:56:17,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:17,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:17,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:17,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:17,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:17,922 INFO L87 Difference]: Start difference. First operand 552 states and 802 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:18,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:18,201 INFO L93 Difference]: Finished difference Result 1003 states and 1453 transitions. [2025-02-07 22:56:18,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:18,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 168 [2025-02-07 22:56:18,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:18,203 INFO L225 Difference]: With dead ends: 1003 [2025-02-07 22:56:18,203 INFO L226 Difference]: Without dead ends: 552 [2025-02-07 22:56:18,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:18,204 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 676 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:18,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1217 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:56:18,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-07 22:56:18,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-02-07 22:56:18,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.453382084095064) internal successors, (795), 547 states have internal predecessors, (795), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:18,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 801 transitions. [2025-02-07 22:56:18,212 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 801 transitions. Word has length 168 [2025-02-07 22:56:18,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:18,212 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 801 transitions. [2025-02-07 22:56:18,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:18,213 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 801 transitions. [2025-02-07 22:56:18,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-07 22:56:18,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:18,214 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:18,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-07 22:56:18,214 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:18,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:18,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1849417884, now seen corresponding path program 1 times [2025-02-07 22:56:18,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:18,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607632361] [2025-02-07 22:56:18,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:18,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:18,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-07 22:56:18,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-07 22:56:18,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:18,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:18,575 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:18,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:18,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607632361] [2025-02-07 22:56:18,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607632361] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:18,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:18,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:18,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222061287] [2025-02-07 22:56:18,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:18,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:18,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:18,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:18,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:18,578 INFO L87 Difference]: Start difference. First operand 552 states and 801 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:18,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:18,877 INFO L93 Difference]: Finished difference Result 1003 states and 1451 transitions. [2025-02-07 22:56:18,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:18,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 169 [2025-02-07 22:56:18,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:18,881 INFO L225 Difference]: With dead ends: 1003 [2025-02-07 22:56:18,881 INFO L226 Difference]: Without dead ends: 552 [2025-02-07 22:56:18,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:18,882 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 1340 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:18,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 1217 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:56:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-07 22:56:18,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-02-07 22:56:18,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4515539305301646) internal successors, (794), 547 states have internal predecessors, (794), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:18,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 800 transitions. [2025-02-07 22:56:18,893 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 800 transitions. Word has length 169 [2025-02-07 22:56:18,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:18,893 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 800 transitions. [2025-02-07 22:56:18,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:18,893 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 800 transitions. [2025-02-07 22:56:18,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-07 22:56:18,894 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:18,894 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:18,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-07 22:56:18,894 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:18,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:18,895 INFO L85 PathProgramCache]: Analyzing trace with hash 40840582, now seen corresponding path program 1 times [2025-02-07 22:56:18,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:18,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232673906] [2025-02-07 22:56:18,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:18,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:18,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-07 22:56:19,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-07 22:56:19,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:19,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:19,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:19,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232673906] [2025-02-07 22:56:19,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232673906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:19,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:19,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:19,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499536463] [2025-02-07 22:56:19,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:19,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:19,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:19,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:19,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:19,205 INFO L87 Difference]: Start difference. First operand 552 states and 800 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:19,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:19,499 INFO L93 Difference]: Finished difference Result 1003 states and 1449 transitions. [2025-02-07 22:56:19,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:19,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 170 [2025-02-07 22:56:19,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:19,501 INFO L225 Difference]: With dead ends: 1003 [2025-02-07 22:56:19,501 INFO L226 Difference]: Without dead ends: 552 [2025-02-07 22:56:19,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:19,502 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 1334 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1334 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:19,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1334 Valid, 1217 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:56:19,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-07 22:56:19,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-02-07 22:56:19,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4497257769652652) internal successors, (793), 547 states have internal predecessors, (793), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:19,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 799 transitions. [2025-02-07 22:56:19,511 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 799 transitions. Word has length 170 [2025-02-07 22:56:19,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:19,511 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 799 transitions. [2025-02-07 22:56:19,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:19,512 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 799 transitions. [2025-02-07 22:56:19,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-07 22:56:19,513 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:19,513 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:19,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-07 22:56:19,513 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:19,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:19,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1595281987, now seen corresponding path program 1 times [2025-02-07 22:56:19,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:19,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943946354] [2025-02-07 22:56:19,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:19,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:19,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-07 22:56:19,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-07 22:56:19,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:19,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:19,884 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:19,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:19,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943946354] [2025-02-07 22:56:19,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943946354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:19,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:19,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:19,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539898712] [2025-02-07 22:56:19,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:19,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:19,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:19,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:19,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:19,886 INFO L87 Difference]: Start difference. First operand 552 states and 799 transitions. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:20,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:20,260 INFO L93 Difference]: Finished difference Result 1009 states and 1455 transitions. [2025-02-07 22:56:20,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:56:20,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 171 [2025-02-07 22:56:20,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:20,262 INFO L225 Difference]: With dead ends: 1009 [2025-02-07 22:56:20,262 INFO L226 Difference]: Without dead ends: 556 [2025-02-07 22:56:20,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-07 22:56:20,264 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 2 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2473 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:20,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2473 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:56:20,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-02-07 22:56:20,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 554. [2025-02-07 22:56:20,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 549 states have (on average 1.4480874316939891) internal successors, (795), 549 states have internal predecessors, (795), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:20,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 801 transitions. [2025-02-07 22:56:20,273 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 801 transitions. Word has length 171 [2025-02-07 22:56:20,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:20,274 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 801 transitions. [2025-02-07 22:56:20,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:20,274 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 801 transitions. [2025-02-07 22:56:20,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-07 22:56:20,275 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:20,275 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:20,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-07 22:56:20,275 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:20,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:20,276 INFO L85 PathProgramCache]: Analyzing trace with hash -395287052, now seen corresponding path program 1 times [2025-02-07 22:56:20,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:20,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64537597] [2025-02-07 22:56:20,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:20,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:20,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-07 22:56:20,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-07 22:56:20,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:20,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:20,615 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:20,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:20,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64537597] [2025-02-07 22:56:20,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64537597] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:20,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:20,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:20,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102901430] [2025-02-07 22:56:20,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:20,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:20,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:20,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:20,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:20,616 INFO L87 Difference]: Start difference. First operand 554 states and 801 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:20,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:20,930 INFO L93 Difference]: Finished difference Result 1007 states and 1451 transitions. [2025-02-07 22:56:20,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:20,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 172 [2025-02-07 22:56:20,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:20,936 INFO L225 Difference]: With dead ends: 1007 [2025-02-07 22:56:20,936 INFO L226 Difference]: Without dead ends: 554 [2025-02-07 22:56:20,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:20,937 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 1326 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:20,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 1217 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:56:20,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-02-07 22:56:20,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2025-02-07 22:56:20,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 549 states have (on average 1.4462659380692167) internal successors, (794), 549 states have internal predecessors, (794), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:20,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 800 transitions. [2025-02-07 22:56:20,951 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 800 transitions. Word has length 172 [2025-02-07 22:56:20,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:20,952 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 800 transitions. [2025-02-07 22:56:20,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:20,952 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 800 transitions. [2025-02-07 22:56:20,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-07 22:56:20,953 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:20,953 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:20,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-07 22:56:20,954 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:20,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:20,954 INFO L85 PathProgramCache]: Analyzing trace with hash 748590929, now seen corresponding path program 1 times [2025-02-07 22:56:20,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:20,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111198421] [2025-02-07 22:56:20,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:20,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:20,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-07 22:56:21,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-07 22:56:21,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:21,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:21,416 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:21,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:21,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111198421] [2025-02-07 22:56:21,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111198421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:21,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:21,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:56:21,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563172784] [2025-02-07 22:56:21,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:21,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:56:21,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:21,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:56:21,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:21,418 INFO L87 Difference]: Start difference. First operand 554 states and 800 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:21,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:21,961 INFO L93 Difference]: Finished difference Result 1076 states and 1530 transitions. [2025-02-07 22:56:21,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:56:21,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 173 [2025-02-07 22:56:21,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:21,964 INFO L225 Difference]: With dead ends: 1076 [2025-02-07 22:56:21,964 INFO L226 Difference]: Without dead ends: 619 [2025-02-07 22:56:21,965 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-02-07 22:56:21,965 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 79 mSDsluCounter, 2562 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 3257 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:21,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 3257 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:56:21,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2025-02-07 22:56:21,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 552. [2025-02-07 22:56:21,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4460694698354661) internal successors, (791), 547 states have internal predecessors, (791), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:21,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 797 transitions. [2025-02-07 22:56:21,979 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 797 transitions. Word has length 173 [2025-02-07 22:56:21,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:21,979 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 797 transitions. [2025-02-07 22:56:21,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:21,979 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 797 transitions. [2025-02-07 22:56:21,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-07 22:56:21,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:21,980 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:21,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-07 22:56:21,981 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:21,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:21,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1041868844, now seen corresponding path program 1 times [2025-02-07 22:56:21,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:21,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218847897] [2025-02-07 22:56:21,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:21,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:22,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-07 22:56:22,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-07 22:56:22,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:22,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:22,251 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:22,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:22,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218847897] [2025-02-07 22:56:22,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218847897] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:22,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:22,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:22,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030609088] [2025-02-07 22:56:22,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:22,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:22,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:22,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:22,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:22,252 INFO L87 Difference]: Start difference. First operand 552 states and 797 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:22,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:22,561 INFO L93 Difference]: Finished difference Result 1003 states and 1443 transitions. [2025-02-07 22:56:22,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:22,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 173 [2025-02-07 22:56:22,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:22,564 INFO L225 Difference]: With dead ends: 1003 [2025-02-07 22:56:22,564 INFO L226 Difference]: Without dead ends: 552 [2025-02-07 22:56:22,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:22,564 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 667 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:22,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 1221 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:56:22,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-07 22:56:22,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-02-07 22:56:22,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4442413162705667) internal successors, (790), 547 states have internal predecessors, (790), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:22,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 796 transitions. [2025-02-07 22:56:22,573 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 796 transitions. Word has length 173 [2025-02-07 22:56:22,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:22,573 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 796 transitions. [2025-02-07 22:56:22,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:22,573 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 796 transitions. [2025-02-07 22:56:22,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-07 22:56:22,574 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:22,574 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:22,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-07 22:56:22,574 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:22,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:22,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1568920892, now seen corresponding path program 1 times [2025-02-07 22:56:22,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:22,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279086356] [2025-02-07 22:56:22,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:22,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:22,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-07 22:56:22,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-07 22:56:22,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:22,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:22,863 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:22,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:22,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279086356] [2025-02-07 22:56:22,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279086356] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:22,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:22,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:22,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872562211] [2025-02-07 22:56:22,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:22,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:22,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:22,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:22,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:22,865 INFO L87 Difference]: Start difference. First operand 552 states and 796 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:23,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:23,148 INFO L93 Difference]: Finished difference Result 1003 states and 1441 transitions. [2025-02-07 22:56:23,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:23,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 174 [2025-02-07 22:56:23,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:23,150 INFO L225 Difference]: With dead ends: 1003 [2025-02-07 22:56:23,150 INFO L226 Difference]: Without dead ends: 552 [2025-02-07 22:56:23,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:23,151 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 1308 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1308 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:23,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1308 Valid, 1215 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:56:23,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-07 22:56:23,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-02-07 22:56:23,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.4424131627056673) internal successors, (789), 547 states have internal predecessors, (789), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:23,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 795 transitions. [2025-02-07 22:56:23,160 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 795 transitions. Word has length 174 [2025-02-07 22:56:23,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:23,160 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 795 transitions. [2025-02-07 22:56:23,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:23,160 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 795 transitions. [2025-02-07 22:56:23,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-07 22:56:23,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:23,161 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:23,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-07 22:56:23,161 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:23,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:23,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1979856281, now seen corresponding path program 1 times [2025-02-07 22:56:23,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:23,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173224087] [2025-02-07 22:56:23,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:23,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:23,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-07 22:56:23,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-07 22:56:23,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:23,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:23,400 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:23,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:23,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173224087] [2025-02-07 22:56:23,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173224087] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:23,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:23,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:56:23,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453184400] [2025-02-07 22:56:23,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:23,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:56:23,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:23,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:56:23,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:56:23,402 INFO L87 Difference]: Start difference. First operand 552 states and 795 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:23,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:23,601 INFO L93 Difference]: Finished difference Result 1003 states and 1439 transitions. [2025-02-07 22:56:23,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:23,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 175 [2025-02-07 22:56:23,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:23,603 INFO L225 Difference]: With dead ends: 1003 [2025-02-07 22:56:23,604 INFO L226 Difference]: Without dead ends: 552 [2025-02-07 22:56:23,605 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-02-07 22:56:23,605 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 684 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:23,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1285 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:23,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-02-07 22:56:23,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-02-07 22:56:23,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 547 states have (on average 1.440585009140768) internal successors, (788), 547 states have internal predecessors, (788), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:23,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 794 transitions. [2025-02-07 22:56:23,613 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 794 transitions. Word has length 175 [2025-02-07 22:56:23,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:23,613 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 794 transitions. [2025-02-07 22:56:23,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:23,613 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 794 transitions. [2025-02-07 22:56:23,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-07 22:56:23,614 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:23,614 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:23,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-07 22:56:23,614 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:23,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:23,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1166205226, now seen corresponding path program 1 times [2025-02-07 22:56:23,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:23,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241754286] [2025-02-07 22:56:23,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:23,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:23,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-07 22:56:23,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-07 22:56:23,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:23,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:24,080 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:24,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:24,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241754286] [2025-02-07 22:56:24,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241754286] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:24,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:24,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:24,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184536680] [2025-02-07 22:56:24,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:24,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:24,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:24,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:24,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:24,083 INFO L87 Difference]: Start difference. First operand 552 states and 794 transitions. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:24,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:24,516 INFO L93 Difference]: Finished difference Result 1007 states and 1442 transitions. [2025-02-07 22:56:24,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:56:24,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 176 [2025-02-07 22:56:24,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:24,519 INFO L225 Difference]: With dead ends: 1007 [2025-02-07 22:56:24,519 INFO L226 Difference]: Without dead ends: 556 [2025-02-07 22:56:24,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-02-07 22:56:24,520 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 692 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:24,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1499 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:56:24,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-02-07 22:56:24,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 555. [2025-02-07 22:56:24,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 550 states have (on average 1.4381818181818182) internal successors, (791), 550 states have internal predecessors, (791), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-07 22:56:24,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 797 transitions. [2025-02-07 22:56:24,538 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 797 transitions. Word has length 176 [2025-02-07 22:56:24,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:24,538 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 797 transitions. [2025-02-07 22:56:24,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:24,539 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 797 transitions. [2025-02-07 22:56:24,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-07 22:56:24,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:24,539 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:24,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-07 22:56:24,539 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:24,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:24,540 INFO L85 PathProgramCache]: Analyzing trace with hash -911707707, now seen corresponding path program 1 times [2025-02-07 22:56:24,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:24,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663313503] [2025-02-07 22:56:24,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:24,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:24,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-07 22:56:24,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-07 22:56:24,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:24,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:24,974 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:24,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:24,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663313503] [2025-02-07 22:56:24,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663313503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:24,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:24,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:56:24,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610241832] [2025-02-07 22:56:24,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:24,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:56:24,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:24,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:56:24,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:24,975 INFO L87 Difference]: Start difference. First operand 555 states and 797 transitions. Second operand has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:25,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:25,663 INFO L93 Difference]: Finished difference Result 1459 states and 2086 transitions. [2025-02-07 22:56:25,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:56:25,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 177 [2025-02-07 22:56:25,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:25,666 INFO L225 Difference]: With dead ends: 1459 [2025-02-07 22:56:25,666 INFO L226 Difference]: Without dead ends: 1005 [2025-02-07 22:56:25,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:56:25,667 INFO L435 NwaCegarLoop]: 1027 mSDtfsCounter, 1944 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1947 SdHoareTripleChecker+Valid, 2399 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:25,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1947 Valid, 2399 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:56:25,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2025-02-07 22:56:25,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 1003. [2025-02-07 22:56:25,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 995 states have (on average 1.4331658291457285) internal successors, (1426), 995 states have internal predecessors, (1426), 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-02-07 22:56:25,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1438 transitions. [2025-02-07 22:56:25,683 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1438 transitions. Word has length 177 [2025-02-07 22:56:25,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:25,684 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1438 transitions. [2025-02-07 22:56:25,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.5) internal successors, (165), 6 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:25,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1438 transitions. [2025-02-07 22:56:25,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-07 22:56:25,685 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:25,685 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:25,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-07 22:56:25,685 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:25,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:25,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1805615693, now seen corresponding path program 1 times [2025-02-07 22:56:25,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:25,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768266385] [2025-02-07 22:56:25,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:25,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:25,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-07 22:56:25,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-07 22:56:25,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:25,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:25,886 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:25,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:25,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768266385] [2025-02-07 22:56:25,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768266385] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:25,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:25,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:56:25,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77313761] [2025-02-07 22:56:25,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:25,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:56:25,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:25,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:56:25,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:56:25,888 INFO L87 Difference]: Start difference. First operand 1003 states and 1438 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:26,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:26,150 INFO L93 Difference]: Finished difference Result 1905 states and 2725 transitions. [2025-02-07 22:56:26,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:26,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 177 [2025-02-07 22:56:26,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:26,153 INFO L225 Difference]: With dead ends: 1905 [2025-02-07 22:56:26,153 INFO L226 Difference]: Without dead ends: 1003 [2025-02-07 22:56:26,155 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-02-07 22:56:26,156 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 675 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:26,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 1255 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:26,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2025-02-07 22:56:26,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1003. [2025-02-07 22:56:26,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 995 states have (on average 1.4311557788944724) internal successors, (1424), 995 states have internal predecessors, (1424), 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-02-07 22:56:26,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1436 transitions. [2025-02-07 22:56:26,192 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1436 transitions. Word has length 177 [2025-02-07 22:56:26,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:26,192 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1436 transitions. [2025-02-07 22:56:26,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:26,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1436 transitions. [2025-02-07 22:56:26,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-07 22:56:26,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:26,193 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:26,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-07 22:56:26,194 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:26,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:26,194 INFO L85 PathProgramCache]: Analyzing trace with hash 587501139, now seen corresponding path program 1 times [2025-02-07 22:56:26,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:26,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490828539] [2025-02-07 22:56:26,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:26,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:26,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-07 22:56:26,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-07 22:56:26,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:26,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:26,739 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:26,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:26,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490828539] [2025-02-07 22:56:26,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490828539] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:26,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:26,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:26,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720739358] [2025-02-07 22:56:26,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:26,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:26,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:26,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:26,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:26,746 INFO L87 Difference]: Start difference. First operand 1003 states and 1436 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:27,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:27,057 INFO L93 Difference]: Finished difference Result 1905 states and 2721 transitions. [2025-02-07 22:56:27,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:27,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 178 [2025-02-07 22:56:27,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:27,060 INFO L225 Difference]: With dead ends: 1905 [2025-02-07 22:56:27,060 INFO L226 Difference]: Without dead ends: 1003 [2025-02-07 22:56:27,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:27,062 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 1342 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:27,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 1255 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:56:27,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2025-02-07 22:56:27,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1003. [2025-02-07 22:56:27,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 995 states have (on average 1.429145728643216) internal successors, (1422), 995 states have internal predecessors, (1422), 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-02-07 22:56:27,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1434 transitions. [2025-02-07 22:56:27,076 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1434 transitions. Word has length 178 [2025-02-07 22:56:27,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:27,077 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1434 transitions. [2025-02-07 22:56:27,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:27,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1434 transitions. [2025-02-07 22:56:27,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-07 22:56:27,078 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:27,078 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:27,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-07 22:56:27,078 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:27,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:27,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1390143063, now seen corresponding path program 1 times [2025-02-07 22:56:27,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:27,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083914421] [2025-02-07 22:56:27,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:27,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:27,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-07 22:56:27,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-07 22:56:27,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:27,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:27,358 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:27,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:27,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083914421] [2025-02-07 22:56:27,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083914421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:27,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:27,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:27,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802553304] [2025-02-07 22:56:27,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:27,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:27,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:27,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:27,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:27,361 INFO L87 Difference]: Start difference. First operand 1003 states and 1434 transitions. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:27,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:27,625 INFO L93 Difference]: Finished difference Result 1905 states and 2717 transitions. [2025-02-07 22:56:27,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:27,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 179 [2025-02-07 22:56:27,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:27,628 INFO L225 Difference]: With dead ends: 1905 [2025-02-07 22:56:27,628 INFO L226 Difference]: Without dead ends: 1003 [2025-02-07 22:56:27,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:27,630 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 672 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:27,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 1261 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:27,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2025-02-07 22:56:27,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1003. [2025-02-07 22:56:27,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 995 states have (on average 1.4271356783919598) internal successors, (1420), 995 states have internal predecessors, (1420), 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-02-07 22:56:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1432 transitions. [2025-02-07 22:56:27,643 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1432 transitions. Word has length 179 [2025-02-07 22:56:27,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:27,644 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1432 transitions. [2025-02-07 22:56:27,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:27,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1432 transitions. [2025-02-07 22:56:27,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-07 22:56:27,645 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:27,645 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:27,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-07 22:56:27,645 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:27,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:27,645 INFO L85 PathProgramCache]: Analyzing trace with hash 256212706, now seen corresponding path program 1 times [2025-02-07 22:56:27,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:27,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259857559] [2025-02-07 22:56:27,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:27,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:27,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-07 22:56:27,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-07 22:56:27,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:27,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:28,328 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:28,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:28,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259857559] [2025-02-07 22:56:28,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259857559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:28,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:28,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:56:28,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228932197] [2025-02-07 22:56:28,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:28,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:56:28,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:28,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:56:28,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:56:28,331 INFO L87 Difference]: Start difference. First operand 1003 states and 1432 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:28,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:28,833 INFO L93 Difference]: Finished difference Result 2037 states and 2903 transitions. [2025-02-07 22:56:28,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:56:28,834 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 180 [2025-02-07 22:56:28,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:28,836 INFO L225 Difference]: With dead ends: 2037 [2025-02-07 22:56:28,836 INFO L226 Difference]: Without dead ends: 1011 [2025-02-07 22:56:28,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-07 22:56:28,838 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 816 mSDsluCounter, 2487 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 3151 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:28,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 3151 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:56:28,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2025-02-07 22:56:28,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1007. [2025-02-07 22:56:28,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 999 states have (on average 1.4234234234234233) internal successors, (1422), 999 states have internal predecessors, (1422), 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-02-07 22:56:28,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1434 transitions. [2025-02-07 22:56:28,851 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1434 transitions. Word has length 180 [2025-02-07 22:56:28,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:28,851 INFO L471 AbstractCegarLoop]: Abstraction has 1007 states and 1434 transitions. [2025-02-07 22:56:28,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:28,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1434 transitions. [2025-02-07 22:56:28,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-02-07 22:56:28,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:28,853 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:28,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-07 22:56:28,853 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:28,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:28,853 INFO L85 PathProgramCache]: Analyzing trace with hash -114528030, now seen corresponding path program 1 times [2025-02-07 22:56:28,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:28,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247310809] [2025-02-07 22:56:28,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:28,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:28,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-07 22:56:28,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-07 22:56:28,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:28,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:29,340 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:29,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:29,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247310809] [2025-02-07 22:56:29,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247310809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:29,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:29,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 22:56:29,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360523309] [2025-02-07 22:56:29,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:29,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:56:29,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:29,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:56:29,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:56:29,342 INFO L87 Difference]: Start difference. First operand 1007 states and 1434 transitions. Second operand has 8 states, 8 states have (on average 21.125) internal successors, (169), 8 states have internal predecessors, (169), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:30,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:30,383 INFO L93 Difference]: Finished difference Result 2823 states and 4009 transitions. [2025-02-07 22:56:30,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 22:56:30,383 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.125) internal successors, (169), 8 states have internal predecessors, (169), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 181 [2025-02-07 22:56:30,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:30,387 INFO L225 Difference]: With dead ends: 2823 [2025-02-07 22:56:30,388 INFO L226 Difference]: Without dead ends: 1917 [2025-02-07 22:56:30,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-02-07 22:56:30,389 INFO L435 NwaCegarLoop]: 928 mSDtfsCounter, 1315 mSDsluCounter, 4050 mSDsCounter, 0 mSdLazyCounter, 2355 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1318 SdHoareTripleChecker+Valid, 4978 SdHoareTripleChecker+Invalid, 2355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:30,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1318 Valid, 4978 Invalid, 2355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2355 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-07 22:56:30,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2025-02-07 22:56:30,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1008. [2025-02-07 22:56:30,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 1000 states have (on average 1.424) internal successors, (1424), 1000 states have internal predecessors, (1424), 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-02-07 22:56:30,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1436 transitions. [2025-02-07 22:56:30,410 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1436 transitions. Word has length 181 [2025-02-07 22:56:30,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:30,410 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1436 transitions. [2025-02-07 22:56:30,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.125) internal successors, (169), 8 states have internal predecessors, (169), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:30,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1436 transitions. [2025-02-07 22:56:30,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-07 22:56:30,411 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:30,411 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:30,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-07 22:56:30,412 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:30,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:30,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1515678573, now seen corresponding path program 1 times [2025-02-07 22:56:30,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:30,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856598931] [2025-02-07 22:56:30,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:30,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:30,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-07 22:56:30,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-07 22:56:30,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:30,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:31,053 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:31,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:31,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856598931] [2025-02-07 22:56:31,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856598931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:31,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:31,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:31,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144242264] [2025-02-07 22:56:31,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:31,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:31,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:31,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:31,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:31,056 INFO L87 Difference]: Start difference. First operand 1008 states and 1436 transitions. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:31,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:31,509 INFO L93 Difference]: Finished difference Result 2073 states and 2900 transitions. [2025-02-07 22:56:31,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:56:31,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 182 [2025-02-07 22:56:31,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:31,516 INFO L225 Difference]: With dead ends: 2073 [2025-02-07 22:56:31,519 INFO L226 Difference]: Without dead ends: 1166 [2025-02-07 22:56:31,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-07 22:56:31,525 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 19 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 2584 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:31,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 2584 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:56:31,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2025-02-07 22:56:31,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1162. [2025-02-07 22:56:31,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 1154 states have (on average 1.382149046793761) internal successors, (1595), 1154 states have internal predecessors, (1595), 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-02-07 22:56:31,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1607 transitions. [2025-02-07 22:56:31,569 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1607 transitions. Word has length 182 [2025-02-07 22:56:31,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:31,570 INFO L471 AbstractCegarLoop]: Abstraction has 1162 states and 1607 transitions. [2025-02-07 22:56:31,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1607 transitions. [2025-02-07 22:56:31,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-07 22:56:31,573 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:31,573 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:31,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-07 22:56:31,573 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:31,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:31,574 INFO L85 PathProgramCache]: Analyzing trace with hash 2146967486, now seen corresponding path program 1 times [2025-02-07 22:56:31,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:31,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76769901] [2025-02-07 22:56:31,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:31,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:31,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-07 22:56:31,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-07 22:56:31,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:31,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:31,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:31,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76769901] [2025-02-07 22:56:31,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76769901] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:31,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:31,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:56:31,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363218177] [2025-02-07 22:56:31,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:31,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:56:31,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:31,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:56:31,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:56:31,946 INFO L87 Difference]: Start difference. First operand 1162 states and 1607 transitions. Second operand has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:56:32,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:32,812 INFO L93 Difference]: Finished difference Result 2231 states and 3075 transitions. [2025-02-07 22:56:32,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:56:32,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 183 [2025-02-07 22:56:32,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:32,818 INFO L225 Difference]: With dead ends: 2231 [2025-02-07 22:56:32,818 INFO L226 Difference]: Without dead ends: 1170 [2025-02-07 22:56:32,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-07 22:56:32,819 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 767 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 1958 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:32,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 1958 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 22:56:32,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2025-02-07 22:56:32,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1166. [2025-02-07 22:56:32,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 1158 states have (on average 1.3791018998272884) internal successors, (1597), 1158 states have internal predecessors, (1597), 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-02-07 22:56:32,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1609 transitions. [2025-02-07 22:56:32,837 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1609 transitions. Word has length 183 [2025-02-07 22:56:32,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:32,837 INFO L471 AbstractCegarLoop]: Abstraction has 1166 states and 1609 transitions. [2025-02-07 22:56:32,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:56:32,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1609 transitions. [2025-02-07 22:56:32,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-07 22:56:32,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:32,847 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:32,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-07 22:56:32,847 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:32,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:32,849 INFO L85 PathProgramCache]: Analyzing trace with hash 559965933, now seen corresponding path program 1 times [2025-02-07 22:56:32,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:32,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995810570] [2025-02-07 22:56:32,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:32,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:32,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-07 22:56:32,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-07 22:56:32,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:32,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:33,214 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:33,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:33,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995810570] [2025-02-07 22:56:33,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995810570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:33,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:33,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 22:56:33,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255226808] [2025-02-07 22:56:33,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:33,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:56:33,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:33,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:56:33,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:56:33,216 INFO L87 Difference]: Start difference. First operand 1166 states and 1609 transitions. Second operand has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:56:34,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:34,312 INFO L93 Difference]: Finished difference Result 3300 states and 4534 transitions. [2025-02-07 22:56:34,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 22:56:34,312 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 184 [2025-02-07 22:56:34,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:34,316 INFO L225 Difference]: With dead ends: 3300 [2025-02-07 22:56:34,316 INFO L226 Difference]: Without dead ends: 2235 [2025-02-07 22:56:34,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-02-07 22:56:34,318 INFO L435 NwaCegarLoop]: 1009 mSDtfsCounter, 1312 mSDsluCounter, 4337 mSDsCounter, 0 mSdLazyCounter, 2487 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1315 SdHoareTripleChecker+Valid, 5346 SdHoareTripleChecker+Invalid, 2487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:34,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1315 Valid, 5346 Invalid, 2487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2487 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-07 22:56:34,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2235 states. [2025-02-07 22:56:34,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2235 to 1167. [2025-02-07 22:56:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1167 states, 1159 states have (on average 1.3796376186367558) internal successors, (1599), 1159 states have internal predecessors, (1599), 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-02-07 22:56:34,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1611 transitions. [2025-02-07 22:56:34,348 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1611 transitions. Word has length 184 [2025-02-07 22:56:34,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:34,348 INFO L471 AbstractCegarLoop]: Abstraction has 1167 states and 1611 transitions. [2025-02-07 22:56:34,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:56:34,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1611 transitions. [2025-02-07 22:56:34,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-07 22:56:34,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:34,349 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:34,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-07 22:56:34,349 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:34,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:34,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1412230913, now seen corresponding path program 1 times [2025-02-07 22:56:34,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:34,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802577896] [2025-02-07 22:56:34,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:34,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:34,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-07 22:56:34,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-07 22:56:34,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:34,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:34,855 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:34,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:34,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802577896] [2025-02-07 22:56:34,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802577896] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:34,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:34,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:56:34,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710711093] [2025-02-07 22:56:34,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:34,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:56:34,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:34,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:56:34,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:34,857 INFO L87 Difference]: Start difference. First operand 1167 states and 1611 transitions. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:35,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:35,428 INFO L93 Difference]: Finished difference Result 1962 states and 2618 transitions. [2025-02-07 22:56:35,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:56:35,429 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 184 [2025-02-07 22:56:35,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:35,431 INFO L225 Difference]: With dead ends: 1962 [2025-02-07 22:56:35,432 INFO L226 Difference]: Without dead ends: 1427 [2025-02-07 22:56:35,432 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-02-07 22:56:35,433 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 748 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 2045 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:35,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 2045 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:56:35,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2025-02-07 22:56:35,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1155. [2025-02-07 22:56:35,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1147 states have (on average 1.3801220575414124) internal successors, (1583), 1147 states have internal predecessors, (1583), 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-02-07 22:56:35,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1595 transitions. [2025-02-07 22:56:35,450 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1595 transitions. Word has length 184 [2025-02-07 22:56:35,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:35,450 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1595 transitions. [2025-02-07 22:56:35,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:35,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1595 transitions. [2025-02-07 22:56:35,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-07 22:56:35,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:35,451 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:35,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-07 22:56:35,451 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:35,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:35,452 INFO L85 PathProgramCache]: Analyzing trace with hash 797657553, now seen corresponding path program 1 times [2025-02-07 22:56:35,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:35,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766713586] [2025-02-07 22:56:35,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:35,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:35,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-07 22:56:35,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-07 22:56:35,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:35,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:35,786 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:35,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:35,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766713586] [2025-02-07 22:56:35,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766713586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:35,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:35,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:56:35,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267868482] [2025-02-07 22:56:35,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:35,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:56:35,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:35,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:56:35,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:35,790 INFO L87 Difference]: Start difference. First operand 1155 states and 1595 transitions. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:56:36,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:36,480 INFO L93 Difference]: Finished difference Result 1687 states and 2320 transitions. [2025-02-07 22:56:36,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:56:36,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 184 [2025-02-07 22:56:36,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:36,484 INFO L225 Difference]: With dead ends: 1687 [2025-02-07 22:56:36,484 INFO L226 Difference]: Without dead ends: 1158 [2025-02-07 22:56:36,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:56:36,485 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 710 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1952 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:36,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 1952 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:56:36,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2025-02-07 22:56:36,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1156. [2025-02-07 22:56:36,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1148 states have (on average 1.3789198606271778) internal successors, (1583), 1148 states have internal predecessors, (1583), 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-02-07 22:56:36,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1595 transitions. [2025-02-07 22:56:36,496 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1595 transitions. Word has length 184 [2025-02-07 22:56:36,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:36,497 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1595 transitions. [2025-02-07 22:56:36,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:56:36,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1595 transitions. [2025-02-07 22:56:36,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-07 22:56:36,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:36,498 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:36,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-07 22:56:36,498 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:36,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:36,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1185971981, now seen corresponding path program 1 times [2025-02-07 22:56:36,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:36,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422459270] [2025-02-07 22:56:36,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:36,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:36,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-07 22:56:36,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-07 22:56:36,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:36,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:36,837 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:36,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:36,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422459270] [2025-02-07 22:56:36,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422459270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:36,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:36,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:56:36,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192098432] [2025-02-07 22:56:36,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:36,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:56:36,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:36,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:56:36,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:56:36,839 INFO L87 Difference]: Start difference. First operand 1156 states and 1595 transitions. Second operand has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:56:37,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:37,458 INFO L93 Difference]: Finished difference Result 2219 states and 3051 transitions. [2025-02-07 22:56:37,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:56:37,459 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 185 [2025-02-07 22:56:37,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:37,462 INFO L225 Difference]: With dead ends: 2219 [2025-02-07 22:56:37,462 INFO L226 Difference]: Without dead ends: 1164 [2025-02-07 22:56:37,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-07 22:56:37,463 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 772 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1954 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:37,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 1954 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:56:37,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2025-02-07 22:56:37,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1160. [2025-02-07 22:56:37,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 1152 states have (on average 1.3758680555555556) internal successors, (1585), 1152 states have internal predecessors, (1585), 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-02-07 22:56:37,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1597 transitions. [2025-02-07 22:56:37,483 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1597 transitions. Word has length 185 [2025-02-07 22:56:37,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:37,483 INFO L471 AbstractCegarLoop]: Abstraction has 1160 states and 1597 transitions. [2025-02-07 22:56:37,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:56:37,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1597 transitions. [2025-02-07 22:56:37,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-02-07 22:56:37,485 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:37,485 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:37,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-07 22:56:37,485 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:37,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:37,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1859418639, now seen corresponding path program 1 times [2025-02-07 22:56:37,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:37,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165477347] [2025-02-07 22:56:37,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:37,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:37,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-07 22:56:37,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-07 22:56:37,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:37,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:37,875 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:37,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:37,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165477347] [2025-02-07 22:56:37,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165477347] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:37,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:37,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:56:37,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450833359] [2025-02-07 22:56:37,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:37,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:56:37,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:37,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:56:37,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:37,879 INFO L87 Difference]: Start difference. First operand 1160 states and 1597 transitions. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:56:38,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:38,427 INFO L93 Difference]: Finished difference Result 2223 states and 3049 transitions. [2025-02-07 22:56:38,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:56:38,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 186 [2025-02-07 22:56:38,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:38,429 INFO L225 Difference]: With dead ends: 2223 [2025-02-07 22:56:38,429 INFO L226 Difference]: Without dead ends: 1164 [2025-02-07 22:56:38,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:56:38,431 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 715 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:38,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 1948 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:56:38,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2025-02-07 22:56:38,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1162. [2025-02-07 22:56:38,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 1154 states have (on average 1.375216637781629) internal successors, (1587), 1154 states have internal predecessors, (1587), 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-02-07 22:56:38,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1599 transitions. [2025-02-07 22:56:38,450 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1599 transitions. Word has length 186 [2025-02-07 22:56:38,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:38,451 INFO L471 AbstractCegarLoop]: Abstraction has 1162 states and 1599 transitions. [2025-02-07 22:56:38,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-07 22:56:38,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1599 transitions. [2025-02-07 22:56:38,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-07 22:56:38,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:38,453 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 22:56:38,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-07 22:56:38,453 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:38,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:38,454 INFO L85 PathProgramCache]: Analyzing trace with hash 388318668, now seen corresponding path program 1 times [2025-02-07 22:56:38,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:38,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230874705] [2025-02-07 22:56:38,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:38,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:38,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-07 22:56:38,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-07 22:56:38,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:38,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:39,177 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 22:56:39,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:39,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230874705] [2025-02-07 22:56:39,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230874705] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:39,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:39,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:56:39,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899471886] [2025-02-07 22:56:39,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:39,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:56:39,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:39,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:56:39,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:56:39,180 INFO L87 Difference]: Start difference. First operand 1162 states and 1599 transitions. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:39,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:39,573 INFO L93 Difference]: Finished difference Result 2678 states and 3598 transitions. [2025-02-07 22:56:39,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:56:39,574 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 187 [2025-02-07 22:56:39,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:39,577 INFO L225 Difference]: With dead ends: 2678 [2025-02-07 22:56:39,577 INFO L226 Difference]: Without dead ends: 1617 [2025-02-07 22:56:39,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-07 22:56:39,578 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 1114 mSDsluCounter, 2541 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 3179 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:39,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 3179 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:56:39,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-07 22:56:39,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-07 22:56:39,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1603 states have (on average 1.325015595757954) internal successors, (2124), 1603 states have internal predecessors, (2124), 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-02-07 22:56:39,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2148 transitions. [2025-02-07 22:56:39,632 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2148 transitions. Word has length 187 [2025-02-07 22:56:39,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:39,632 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2148 transitions. [2025-02-07 22:56:39,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 22:56:39,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2148 transitions. [2025-02-07 22:56:39,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-02-07 22:56:39,639 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:39,639 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:56:39,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-07 22:56:39,639 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:39,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:39,639 INFO L85 PathProgramCache]: Analyzing trace with hash -81282242, now seen corresponding path program 1 times [2025-02-07 22:56:39,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:39,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981450822] [2025-02-07 22:56:39,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:39,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:39,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-02-07 22:56:40,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-02-07 22:56:40,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:40,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:40,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:40,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981450822] [2025-02-07 22:56:40,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981450822] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:40,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:40,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:40,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588165395] [2025-02-07 22:56:40,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:40,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:40,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:40,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:40,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:40,696 INFO L87 Difference]: Start difference. First operand 1617 states and 2148 transitions. Second operand has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:40,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:40,967 INFO L93 Difference]: Finished difference Result 2678 states and 3596 transitions. [2025-02-07 22:56:40,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:40,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 461 [2025-02-07 22:56:40,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:40,970 INFO L225 Difference]: With dead ends: 2678 [2025-02-07 22:56:40,970 INFO L226 Difference]: Without dead ends: 1617 [2025-02-07 22:56:40,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:40,972 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 719 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:40,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1205 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:40,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-07 22:56:40,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-07 22:56:40,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1603 states have (on average 1.323767935121647) internal successors, (2122), 1603 states have internal predecessors, (2122), 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-02-07 22:56:40,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2146 transitions. [2025-02-07 22:56:40,990 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2146 transitions. Word has length 461 [2025-02-07 22:56:40,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:40,990 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2146 transitions. [2025-02-07 22:56:40,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:40,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2146 transitions. [2025-02-07 22:56:40,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-02-07 22:56:40,993 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:40,994 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:56:40,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-07 22:56:40,994 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:40,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:40,995 INFO L85 PathProgramCache]: Analyzing trace with hash -220261208, now seen corresponding path program 1 times [2025-02-07 22:56:40,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:40,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228850462] [2025-02-07 22:56:40,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:40,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:41,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-02-07 22:56:41,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-02-07 22:56:41,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:41,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:41,494 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:41,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:41,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228850462] [2025-02-07 22:56:41,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228850462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:41,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:41,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:41,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110299600] [2025-02-07 22:56:41,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:41,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:41,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:41,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:41,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:41,495 INFO L87 Difference]: Start difference. First operand 1617 states and 2146 transitions. Second operand has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:41,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:41,839 INFO L93 Difference]: Finished difference Result 2678 states and 3592 transitions. [2025-02-07 22:56:41,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:41,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 462 [2025-02-07 22:56:41,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:41,842 INFO L225 Difference]: With dead ends: 2678 [2025-02-07 22:56:41,842 INFO L226 Difference]: Without dead ends: 1617 [2025-02-07 22:56:41,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:41,844 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 711 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:41,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 1205 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:56:41,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-07 22:56:41,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-07 22:56:41,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1603 states have (on average 1.32252027448534) internal successors, (2120), 1603 states have internal predecessors, (2120), 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-02-07 22:56:41,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2144 transitions. [2025-02-07 22:56:41,863 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2144 transitions. Word has length 462 [2025-02-07 22:56:41,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:41,864 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2144 transitions. [2025-02-07 22:56:41,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:41,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2144 transitions. [2025-02-07 22:56:41,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-02-07 22:56:41,867 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:41,867 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:56:41,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-07 22:56:41,867 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:41,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:41,868 INFO L85 PathProgramCache]: Analyzing trace with hash -296201521, now seen corresponding path program 1 times [2025-02-07 22:56:41,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:41,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888625127] [2025-02-07 22:56:41,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:41,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:41,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-02-07 22:56:42,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-02-07 22:56:42,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:42,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:42,335 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:42,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:42,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888625127] [2025-02-07 22:56:42,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888625127] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:42,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:42,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:42,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412883076] [2025-02-07 22:56:42,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:42,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:42,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:42,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:42,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:42,337 INFO L87 Difference]: Start difference. First operand 1617 states and 2144 transitions. Second operand has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:42,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:42,562 INFO L93 Difference]: Finished difference Result 2678 states and 3588 transitions. [2025-02-07 22:56:42,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:42,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 463 [2025-02-07 22:56:42,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:42,565 INFO L225 Difference]: With dead ends: 2678 [2025-02-07 22:56:42,565 INFO L226 Difference]: Without dead ends: 1617 [2025-02-07 22:56:42,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:42,567 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 703 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:42,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 1205 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:42,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-07 22:56:42,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-07 22:56:42,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1603 states have (on average 1.3212726138490332) internal successors, (2118), 1603 states have internal predecessors, (2118), 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-02-07 22:56:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2142 transitions. [2025-02-07 22:56:42,584 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2142 transitions. Word has length 463 [2025-02-07 22:56:42,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:42,584 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2142 transitions. [2025-02-07 22:56:42,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:42,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2142 transitions. [2025-02-07 22:56:42,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-02-07 22:56:42,587 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:42,587 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:56:42,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-07 22:56:42,587 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:42,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:42,588 INFO L85 PathProgramCache]: Analyzing trace with hash 804951193, now seen corresponding path program 1 times [2025-02-07 22:56:42,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:42,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221637703] [2025-02-07 22:56:42,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:42,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:42,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-02-07 22:56:42,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-02-07 22:56:42,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:42,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:43,214 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:43,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:43,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221637703] [2025-02-07 22:56:43,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221637703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:43,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:43,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:43,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020506587] [2025-02-07 22:56:43,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:43,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:43,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:43,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:43,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:43,216 INFO L87 Difference]: Start difference. First operand 1617 states and 2142 transitions. Second operand has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:43,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:43,484 INFO L93 Difference]: Finished difference Result 2678 states and 3584 transitions. [2025-02-07 22:56:43,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:43,486 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 464 [2025-02-07 22:56:43,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:43,490 INFO L225 Difference]: With dead ends: 2678 [2025-02-07 22:56:43,490 INFO L226 Difference]: Without dead ends: 1617 [2025-02-07 22:56:43,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:43,491 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 695 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:43,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 1205 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:43,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-07 22:56:43,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-07 22:56:43,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1603 states have (on average 1.3200249532127262) internal successors, (2116), 1603 states have internal predecessors, (2116), 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-02-07 22:56:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2140 transitions. [2025-02-07 22:56:43,529 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2140 transitions. Word has length 464 [2025-02-07 22:56:43,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:43,529 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2140 transitions. [2025-02-07 22:56:43,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:43,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2140 transitions. [2025-02-07 22:56:43,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-02-07 22:56:43,536 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:43,536 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:56:43,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-07 22:56:43,537 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:43,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:43,537 INFO L85 PathProgramCache]: Analyzing trace with hash -193058848, now seen corresponding path program 1 times [2025-02-07 22:56:43,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:43,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146095271] [2025-02-07 22:56:43,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:43,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:43,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-02-07 22:56:43,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-02-07 22:56:43,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:43,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:44,381 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:44,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:44,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146095271] [2025-02-07 22:56:44,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146095271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:44,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:44,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:44,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519796394] [2025-02-07 22:56:44,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:44,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:44,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:44,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:44,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:44,388 INFO L87 Difference]: Start difference. First operand 1617 states and 2140 transitions. Second operand has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:44,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:44,642 INFO L93 Difference]: Finished difference Result 2678 states and 3580 transitions. [2025-02-07 22:56:44,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:44,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 465 [2025-02-07 22:56:44,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:44,649 INFO L225 Difference]: With dead ends: 2678 [2025-02-07 22:56:44,653 INFO L226 Difference]: Without dead ends: 1617 [2025-02-07 22:56:44,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:44,655 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 1245 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1248 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:44,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1248 Valid, 1199 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:44,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-07 22:56:44,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-07 22:56:44,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1603 states have (on average 1.3187772925764192) internal successors, (2114), 1603 states have internal predecessors, (2114), 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-02-07 22:56:44,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2138 transitions. [2025-02-07 22:56:44,698 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2138 transitions. Word has length 465 [2025-02-07 22:56:44,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:44,699 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2138 transitions. [2025-02-07 22:56:44,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:44,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2138 transitions. [2025-02-07 22:56:44,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-02-07 22:56:44,707 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:44,708 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:56:44,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-02-07 22:56:44,708 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:44,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:44,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1067709942, now seen corresponding path program 1 times [2025-02-07 22:56:44,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:44,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009970383] [2025-02-07 22:56:44,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:44,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:44,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-02-07 22:56:45,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-02-07 22:56:45,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:45,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:45,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:45,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009970383] [2025-02-07 22:56:45,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009970383] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:45,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:45,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:45,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010908790] [2025-02-07 22:56:45,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:45,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:45,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:45,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:45,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:45,348 INFO L87 Difference]: Start difference. First operand 1617 states and 2138 transitions. Second operand has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:45,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:45,554 INFO L93 Difference]: Finished difference Result 2678 states and 3576 transitions. [2025-02-07 22:56:45,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:45,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 466 [2025-02-07 22:56:45,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:45,556 INFO L225 Difference]: With dead ends: 2678 [2025-02-07 22:56:45,556 INFO L226 Difference]: Without dead ends: 1617 [2025-02-07 22:56:45,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:45,558 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 679 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:45,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1205 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:45,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-07 22:56:45,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-07 22:56:45,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1603 states have (on average 1.3175296319401122) internal successors, (2112), 1603 states have internal predecessors, (2112), 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-02-07 22:56:45,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2136 transitions. [2025-02-07 22:56:45,576 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2136 transitions. Word has length 466 [2025-02-07 22:56:45,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:45,576 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2136 transitions. [2025-02-07 22:56:45,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:45,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2136 transitions. [2025-02-07 22:56:45,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-02-07 22:56:45,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:45,579 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:56:45,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-02-07 22:56:45,579 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:45,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:45,579 INFO L85 PathProgramCache]: Analyzing trace with hash 558791281, now seen corresponding path program 1 times [2025-02-07 22:56:45,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:45,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291012617] [2025-02-07 22:56:45,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:45,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:45,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-02-07 22:56:45,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-02-07 22:56:45,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:45,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:46,110 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:46,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:46,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291012617] [2025-02-07 22:56:46,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291012617] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:46,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:46,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:46,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151070723] [2025-02-07 22:56:46,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:46,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:46,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:46,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:46,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:46,112 INFO L87 Difference]: Start difference. First operand 1617 states and 2136 transitions. Second operand has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:46,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:46,307 INFO L93 Difference]: Finished difference Result 2678 states and 3572 transitions. [2025-02-07 22:56:46,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:46,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 467 [2025-02-07 22:56:46,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:46,311 INFO L225 Difference]: With dead ends: 2678 [2025-02-07 22:56:46,311 INFO L226 Difference]: Without dead ends: 1617 [2025-02-07 22:56:46,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:46,312 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 1213 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:46,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1216 Valid, 1199 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:46,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-07 22:56:46,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-07 22:56:46,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1603 states have (on average 1.3162819713038054) internal successors, (2110), 1603 states have internal predecessors, (2110), 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-02-07 22:56:46,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2134 transitions. [2025-02-07 22:56:46,332 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2134 transitions. Word has length 467 [2025-02-07 22:56:46,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:46,333 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2134 transitions. [2025-02-07 22:56:46,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:46,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2134 transitions. [2025-02-07 22:56:46,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-02-07 22:56:46,335 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:46,335 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:56:46,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-02-07 22:56:46,336 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:46,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:46,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1038267643, now seen corresponding path program 1 times [2025-02-07 22:56:46,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:46,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515912728] [2025-02-07 22:56:46,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:46,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:46,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-02-07 22:56:46,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-02-07 22:56:46,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:46,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:46,979 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:46,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:46,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515912728] [2025-02-07 22:56:46,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515912728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:46,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:46,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:46,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53989002] [2025-02-07 22:56:46,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:46,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:46,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:46,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:46,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:46,981 INFO L87 Difference]: Start difference. First operand 1617 states and 2134 transitions. Second operand has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:47,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:47,241 INFO L93 Difference]: Finished difference Result 2678 states and 3568 transitions. [2025-02-07 22:56:47,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:47,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 468 [2025-02-07 22:56:47,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:47,244 INFO L225 Difference]: With dead ends: 2678 [2025-02-07 22:56:47,244 INFO L226 Difference]: Without dead ends: 1617 [2025-02-07 22:56:47,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:47,246 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 1197 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:47,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1200 Valid, 1199 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:47,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-07 22:56:47,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-07 22:56:47,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1603 states have (on average 1.3150343106674984) internal successors, (2108), 1603 states have internal predecessors, (2108), 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-02-07 22:56:47,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2132 transitions. [2025-02-07 22:56:47,275 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2132 transitions. Word has length 468 [2025-02-07 22:56:47,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:47,276 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2132 transitions. [2025-02-07 22:56:47,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:47,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2132 transitions. [2025-02-07 22:56:47,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-02-07 22:56:47,279 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:47,280 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:56:47,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-02-07 22:56:47,280 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:47,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:47,281 INFO L85 PathProgramCache]: Analyzing trace with hash 421431938, now seen corresponding path program 1 times [2025-02-07 22:56:47,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:47,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287920682] [2025-02-07 22:56:47,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:47,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:47,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-02-07 22:56:47,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-02-07 22:56:47,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:47,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:47,925 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:47,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:47,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287920682] [2025-02-07 22:56:47,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287920682] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:47,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:47,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:47,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479381343] [2025-02-07 22:56:47,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:47,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:47,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:47,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:47,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:47,927 INFO L87 Difference]: Start difference. First operand 1617 states and 2132 transitions. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:48,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:48,156 INFO L93 Difference]: Finished difference Result 2678 states and 3564 transitions. [2025-02-07 22:56:48,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:48,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 469 [2025-02-07 22:56:48,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:48,159 INFO L225 Difference]: With dead ends: 2678 [2025-02-07 22:56:48,159 INFO L226 Difference]: Without dead ends: 1617 [2025-02-07 22:56:48,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:48,160 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 640 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:48,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 1237 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:48,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-07 22:56:48,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-07 22:56:48,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1603 states have (on average 1.3137866500311914) internal successors, (2106), 1603 states have internal predecessors, (2106), 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-02-07 22:56:48,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2130 transitions. [2025-02-07 22:56:48,177 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2130 transitions. Word has length 469 [2025-02-07 22:56:48,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:48,177 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2130 transitions. [2025-02-07 22:56:48,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:48,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2130 transitions. [2025-02-07 22:56:48,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-02-07 22:56:48,180 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:48,180 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:56:48,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-02-07 22:56:48,180 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:48,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:48,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1687016812, now seen corresponding path program 1 times [2025-02-07 22:56:48,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:48,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580623839] [2025-02-07 22:56:48,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:48,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:48,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-02-07 22:56:48,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-02-07 22:56:48,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:48,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:48,705 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:48,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:48,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580623839] [2025-02-07 22:56:48,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580623839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:48,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:48,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:48,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008899399] [2025-02-07 22:56:48,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:48,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:48,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:48,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:48,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:48,707 INFO L87 Difference]: Start difference. First operand 1617 states and 2130 transitions. Second operand has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:48,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:48,919 INFO L93 Difference]: Finished difference Result 2678 states and 3560 transitions. [2025-02-07 22:56:48,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:48,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 470 [2025-02-07 22:56:48,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:48,921 INFO L225 Difference]: With dead ends: 2678 [2025-02-07 22:56:48,921 INFO L226 Difference]: Without dead ends: 1617 [2025-02-07 22:56:48,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:48,923 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 1150 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:48,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 1231 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:48,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-07 22:56:48,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-07 22:56:48,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1603 states have (on average 1.3125389893948847) internal successors, (2104), 1603 states have internal predecessors, (2104), 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-02-07 22:56:48,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2128 transitions. [2025-02-07 22:56:48,938 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2128 transitions. Word has length 470 [2025-02-07 22:56:48,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:48,939 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2128 transitions. [2025-02-07 22:56:48,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.6) internal successors, (443), 5 states have internal predecessors, (443), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:48,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2128 transitions. [2025-02-07 22:56:48,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-02-07 22:56:48,941 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:48,942 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:56:48,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-02-07 22:56:48,942 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:48,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:48,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1357092883, now seen corresponding path program 1 times [2025-02-07 22:56:48,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:48,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924400811] [2025-02-07 22:56:48,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:48,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:49,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-02-07 22:56:49,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-02-07 22:56:49,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:49,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:49,470 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:49,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:49,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924400811] [2025-02-07 22:56:49,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924400811] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:49,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:49,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:49,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119552477] [2025-02-07 22:56:49,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:49,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:49,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:49,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:49,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:49,472 INFO L87 Difference]: Start difference. First operand 1617 states and 2128 transitions. Second operand has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:49,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:49,676 INFO L93 Difference]: Finished difference Result 2678 states and 3556 transitions. [2025-02-07 22:56:49,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:49,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 471 [2025-02-07 22:56:49,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:49,678 INFO L225 Difference]: With dead ends: 2678 [2025-02-07 22:56:49,679 INFO L226 Difference]: Without dead ends: 1617 [2025-02-07 22:56:49,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:49,680 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 1134 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1137 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:49,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1137 Valid, 1231 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:49,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-07 22:56:49,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-07 22:56:49,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1603 states have (on average 1.3112913287585777) internal successors, (2102), 1603 states have internal predecessors, (2102), 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-02-07 22:56:49,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2126 transitions. [2025-02-07 22:56:49,697 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2126 transitions. Word has length 471 [2025-02-07 22:56:49,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:49,697 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2126 transitions. [2025-02-07 22:56:49,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.8) internal successors, (444), 5 states have internal predecessors, (444), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:49,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2126 transitions. [2025-02-07 22:56:49,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-02-07 22:56:49,700 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:49,700 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:56:49,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-02-07 22:56:49,700 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:49,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:49,701 INFO L85 PathProgramCache]: Analyzing trace with hash -226710691, now seen corresponding path program 1 times [2025-02-07 22:56:49,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:49,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000346041] [2025-02-07 22:56:49,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:49,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:49,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-02-07 22:56:49,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-02-07 22:56:49,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:49,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:50,245 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:50,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:50,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000346041] [2025-02-07 22:56:50,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000346041] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:50,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:50,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:50,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744481139] [2025-02-07 22:56:50,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:50,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:50,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:50,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:50,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:50,247 INFO L87 Difference]: Start difference. First operand 1617 states and 2126 transitions. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:50,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:50,456 INFO L93 Difference]: Finished difference Result 2678 states and 3552 transitions. [2025-02-07 22:56:50,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:50,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 472 [2025-02-07 22:56:50,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:50,457 INFO L225 Difference]: With dead ends: 2678 [2025-02-07 22:56:50,457 INFO L226 Difference]: Without dead ends: 1617 [2025-02-07 22:56:50,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:50,459 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 616 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:50,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 1237 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:50,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-07 22:56:50,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-07 22:56:50,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1603 states have (on average 1.3100436681222707) internal successors, (2100), 1603 states have internal predecessors, (2100), 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-02-07 22:56:50,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2124 transitions. [2025-02-07 22:56:50,477 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2124 transitions. Word has length 472 [2025-02-07 22:56:50,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:50,477 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2124 transitions. [2025-02-07 22:56:50,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:50,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2124 transitions. [2025-02-07 22:56:50,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-02-07 22:56:50,480 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:50,480 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:56:50,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-02-07 22:56:50,480 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:50,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:50,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1311957796, now seen corresponding path program 1 times [2025-02-07 22:56:50,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:50,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212148658] [2025-02-07 22:56:50,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:50,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:50,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-02-07 22:56:50,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-02-07 22:56:50,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:50,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:51,059 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:51,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:51,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212148658] [2025-02-07 22:56:51,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212148658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:51,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:51,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:51,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018487645] [2025-02-07 22:56:51,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:51,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:51,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:51,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:51,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:51,061 INFO L87 Difference]: Start difference. First operand 1617 states and 2124 transitions. Second operand has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:51,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:51,247 INFO L93 Difference]: Finished difference Result 2678 states and 3548 transitions. [2025-02-07 22:56:51,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:51,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 473 [2025-02-07 22:56:51,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:51,250 INFO L225 Difference]: With dead ends: 2678 [2025-02-07 22:56:51,250 INFO L226 Difference]: Without dead ends: 1617 [2025-02-07 22:56:51,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:51,251 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 601 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:51,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 1253 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:51,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-07 22:56:51,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-07 22:56:51,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1603 states have (on average 1.308796007485964) internal successors, (2098), 1603 states have internal predecessors, (2098), 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-02-07 22:56:51,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2122 transitions. [2025-02-07 22:56:51,271 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2122 transitions. Word has length 473 [2025-02-07 22:56:51,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:51,272 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2122 transitions. [2025-02-07 22:56:51,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:51,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2122 transitions. [2025-02-07 22:56:51,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-02-07 22:56:51,275 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:51,275 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:56:51,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-02-07 22:56:51,275 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:51,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:51,276 INFO L85 PathProgramCache]: Analyzing trace with hash -2014415154, now seen corresponding path program 1 times [2025-02-07 22:56:51,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:51,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279571983] [2025-02-07 22:56:51,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:51,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:51,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-02-07 22:56:51,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-02-07 22:56:51,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:51,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:51,806 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:51,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:51,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279571983] [2025-02-07 22:56:51,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279571983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:51,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:51,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:51,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926100793] [2025-02-07 22:56:51,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:51,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:51,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:51,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:51,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:51,808 INFO L87 Difference]: Start difference. First operand 1617 states and 2122 transitions. Second operand has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:51,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:51,987 INFO L93 Difference]: Finished difference Result 2678 states and 3544 transitions. [2025-02-07 22:56:51,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:51,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 474 [2025-02-07 22:56:51,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:51,989 INFO L225 Difference]: With dead ends: 2678 [2025-02-07 22:56:51,989 INFO L226 Difference]: Without dead ends: 1617 [2025-02-07 22:56:51,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:51,990 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 1079 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1082 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:51,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1082 Valid, 1247 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:51,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-07 22:56:52,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-07 22:56:52,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1603 states have (on average 1.307548346849657) internal successors, (2096), 1603 states have internal predecessors, (2096), 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-02-07 22:56:52,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2120 transitions. [2025-02-07 22:56:52,021 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2120 transitions. Word has length 474 [2025-02-07 22:56:52,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:52,021 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2120 transitions. [2025-02-07 22:56:52,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:52,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2120 transitions. [2025-02-07 22:56:52,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-02-07 22:56:52,024 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:52,024 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:56:52,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-02-07 22:56:52,024 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:52,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:52,025 INFO L85 PathProgramCache]: Analyzing trace with hash -415126603, now seen corresponding path program 1 times [2025-02-07 22:56:52,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:52,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477837962] [2025-02-07 22:56:52,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:52,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:52,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-02-07 22:56:52,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-02-07 22:56:52,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:52,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:52,831 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:52,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:52,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477837962] [2025-02-07 22:56:52,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477837962] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:52,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:52,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:52,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562860947] [2025-02-07 22:56:52,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:52,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:52,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:52,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:52,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:52,833 INFO L87 Difference]: Start difference. First operand 1617 states and 2120 transitions. Second operand has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:53,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:53,166 INFO L93 Difference]: Finished difference Result 2678 states and 3540 transitions. [2025-02-07 22:56:53,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:53,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 475 [2025-02-07 22:56:53,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:53,168 INFO L225 Difference]: With dead ends: 2678 [2025-02-07 22:56:53,168 INFO L226 Difference]: Without dead ends: 1617 [2025-02-07 22:56:53,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:53,169 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 1013 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:53,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 959 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:56:53,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-07 22:56:53,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-07 22:56:53,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1603 states have (on average 1.30630068621335) internal successors, (2094), 1603 states have internal predecessors, (2094), 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-02-07 22:56:53,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2118 transitions. [2025-02-07 22:56:53,196 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2118 transitions. Word has length 475 [2025-02-07 22:56:53,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:53,197 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2118 transitions. [2025-02-07 22:56:53,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:53,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2118 transitions. [2025-02-07 22:56:53,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-02-07 22:56:53,201 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:53,201 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:56:53,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-02-07 22:56:53,201 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:53,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:53,202 INFO L85 PathProgramCache]: Analyzing trace with hash -2025687105, now seen corresponding path program 1 times [2025-02-07 22:56:53,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:53,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430053812] [2025-02-07 22:56:53,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:53,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:53,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-02-07 22:56:53,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-02-07 22:56:53,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:53,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:54,108 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:54,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:54,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430053812] [2025-02-07 22:56:54,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430053812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:54,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:54,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:54,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119529750] [2025-02-07 22:56:54,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:54,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:54,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:54,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:54,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:54,110 INFO L87 Difference]: Start difference. First operand 1617 states and 2118 transitions. Second operand has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:54,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:54,317 INFO L93 Difference]: Finished difference Result 2678 states and 3536 transitions. [2025-02-07 22:56:54,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:54,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 476 [2025-02-07 22:56:54,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:54,319 INFO L225 Difference]: With dead ends: 2678 [2025-02-07 22:56:54,319 INFO L226 Difference]: Without dead ends: 1617 [2025-02-07 22:56:54,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:54,320 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 653 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:54,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 1251 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:54,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-07 22:56:54,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-07 22:56:54,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1603 states have (on average 1.305053025577043) internal successors, (2092), 1603 states have internal predecessors, (2092), 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-02-07 22:56:54,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2116 transitions. [2025-02-07 22:56:54,337 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2116 transitions. Word has length 476 [2025-02-07 22:56:54,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:54,338 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2116 transitions. [2025-02-07 22:56:54,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:54,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2116 transitions. [2025-02-07 22:56:54,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-02-07 22:56:54,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:54,341 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:56:54,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-02-07 22:56:54,341 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:54,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:54,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1796280268, now seen corresponding path program 1 times [2025-02-07 22:56:54,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:54,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818712519] [2025-02-07 22:56:54,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:54,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:54,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-02-07 22:56:54,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-02-07 22:56:54,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:54,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:55,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:55,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818712519] [2025-02-07 22:56:55,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818712519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:55,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:55,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:55,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006444825] [2025-02-07 22:56:55,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:55,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:55,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:55,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:55,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:55,272 INFO L87 Difference]: Start difference. First operand 1617 states and 2116 transitions. Second operand has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:55,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:55,514 INFO L93 Difference]: Finished difference Result 2678 states and 3532 transitions. [2025-02-07 22:56:55,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:55,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 477 [2025-02-07 22:56:55,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:55,516 INFO L225 Difference]: With dead ends: 2678 [2025-02-07 22:56:55,516 INFO L226 Difference]: Without dead ends: 1617 [2025-02-07 22:56:55,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:55,517 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 645 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:55,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 1229 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:55,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-07 22:56:55,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-07 22:56:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1603 states have (on average 1.3038053649407362) internal successors, (2090), 1603 states have internal predecessors, (2090), 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-02-07 22:56:55,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2114 transitions. [2025-02-07 22:56:55,533 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2114 transitions. Word has length 477 [2025-02-07 22:56:55,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:55,533 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2114 transitions. [2025-02-07 22:56:55,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:55,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2114 transitions. [2025-02-07 22:56:55,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-02-07 22:56:55,536 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:55,536 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:56:55,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-02-07 22:56:55,536 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:55,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:55,537 INFO L85 PathProgramCache]: Analyzing trace with hash -2114020608, now seen corresponding path program 1 times [2025-02-07 22:56:55,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:55,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020168784] [2025-02-07 22:56:55,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:55,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:55,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-02-07 22:56:55,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-02-07 22:56:55,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:55,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:56,412 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:56,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:56,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020168784] [2025-02-07 22:56:56,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020168784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:56,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:56,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:56,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978952471] [2025-02-07 22:56:56,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:56,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:56,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:56,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:56,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:56,414 INFO L87 Difference]: Start difference. First operand 1617 states and 2114 transitions. Second operand has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:56,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:56,679 INFO L93 Difference]: Finished difference Result 2678 states and 3528 transitions. [2025-02-07 22:56:56,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:56,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 478 [2025-02-07 22:56:56,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:56,680 INFO L225 Difference]: With dead ends: 2678 [2025-02-07 22:56:56,681 INFO L226 Difference]: Without dead ends: 1617 [2025-02-07 22:56:56,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:56,682 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 644 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:56,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 1229 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:56,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-07 22:56:56,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-07 22:56:56,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1603 states have (on average 1.3025577043044292) internal successors, (2088), 1603 states have internal predecessors, (2088), 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-02-07 22:56:56,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2112 transitions. [2025-02-07 22:56:56,697 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2112 transitions. Word has length 478 [2025-02-07 22:56:56,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:56,697 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2112 transitions. [2025-02-07 22:56:56,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:56,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2112 transitions. [2025-02-07 22:56:56,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-02-07 22:56:56,700 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:56,700 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:56:56,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-02-07 22:56:56,700 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:56,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:56,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1554872803, now seen corresponding path program 1 times [2025-02-07 22:56:56,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:56,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088318036] [2025-02-07 22:56:56,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:56,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:56,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-02-07 22:56:57,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-02-07 22:56:57,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:57,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:57,589 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:57,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:57,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088318036] [2025-02-07 22:56:57,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088318036] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:57,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:57,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:56:57,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160004735] [2025-02-07 22:56:57,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:57,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:56:57,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:57,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:56:57,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:56:57,590 INFO L87 Difference]: Start difference. First operand 1617 states and 2112 transitions. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:57,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:57,813 INFO L93 Difference]: Finished difference Result 2678 states and 3524 transitions. [2025-02-07 22:56:57,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:57,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 479 [2025-02-07 22:56:57,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:57,815 INFO L225 Difference]: With dead ends: 2678 [2025-02-07 22:56:57,815 INFO L226 Difference]: Without dead ends: 1617 [2025-02-07 22:56:57,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-02-07 22:56:57,816 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 494 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:57,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 1223 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:57,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-07 22:56:57,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-07 22:56:57,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1603 states have (on average 1.3013100436681222) internal successors, (2086), 1603 states have internal predecessors, (2086), 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-02-07 22:56:57,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2110 transitions. [2025-02-07 22:56:57,833 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2110 transitions. Word has length 479 [2025-02-07 22:56:57,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:57,833 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2110 transitions. [2025-02-07 22:56:57,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:57,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2110 transitions. [2025-02-07 22:56:57,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-02-07 22:56:57,836 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:57,836 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:56:57,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-02-07 22:56:57,836 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:57,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:57,837 INFO L85 PathProgramCache]: Analyzing trace with hash 212816851, now seen corresponding path program 1 times [2025-02-07 22:56:57,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:57,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705755435] [2025-02-07 22:56:57,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:57,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:57,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-02-07 22:56:58,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-02-07 22:56:58,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:58,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:56:58,720 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:56:58,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:56:58,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705755435] [2025-02-07 22:56:58,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705755435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:56:58,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:56:58,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:56:58,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528840231] [2025-02-07 22:56:58,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:56:58,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:56:58,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:56:58,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:56:58,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:56:58,723 INFO L87 Difference]: Start difference. First operand 1617 states and 2110 transitions. Second operand has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:58,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:56:58,960 INFO L93 Difference]: Finished difference Result 2678 states and 3520 transitions. [2025-02-07 22:56:58,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:56:58,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 480 [2025-02-07 22:56:58,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:56:58,962 INFO L225 Difference]: With dead ends: 2678 [2025-02-07 22:56:58,963 INFO L226 Difference]: Without dead ends: 1617 [2025-02-07 22:56:58,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:56:58,964 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 1191 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1191 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:56:58,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1191 Valid, 1177 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:56:58,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-07 22:56:58,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-07 22:56:58,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1603 states have (on average 1.3000623830318154) internal successors, (2084), 1603 states have internal predecessors, (2084), 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-02-07 22:56:58,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2108 transitions. [2025-02-07 22:56:58,986 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2108 transitions. Word has length 480 [2025-02-07 22:56:58,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:56:58,987 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2108 transitions. [2025-02-07 22:56:58,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.6) internal successors, (453), 5 states have internal predecessors, (453), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:56:58,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2108 transitions. [2025-02-07 22:56:58,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-02-07 22:56:58,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:56:58,990 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:56:58,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-02-07 22:56:58,990 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:56:58,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:56:58,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1793931418, now seen corresponding path program 1 times [2025-02-07 22:56:58,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:56:58,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008236360] [2025-02-07 22:56:58,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:56:58,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:56:59,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-02-07 22:56:59,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-02-07 22:56:59,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:56:59,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:00,166 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:00,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:00,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008236360] [2025-02-07 22:57:00,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008236360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:00,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:00,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:00,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948136758] [2025-02-07 22:57:00,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:00,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:00,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:00,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:00,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:00,168 INFO L87 Difference]: Start difference. First operand 1617 states and 2108 transitions. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:00,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:00,448 INFO L93 Difference]: Finished difference Result 2678 states and 3516 transitions. [2025-02-07 22:57:00,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:00,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 481 [2025-02-07 22:57:00,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:00,450 INFO L225 Difference]: With dead ends: 2678 [2025-02-07 22:57:00,450 INFO L226 Difference]: Without dead ends: 1617 [2025-02-07 22:57:00,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:00,452 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 1181 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:00,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 1177 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:57:00,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-07 22:57:00,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-07 22:57:00,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1603 states have (on average 1.2988147223955084) internal successors, (2082), 1603 states have internal predecessors, (2082), 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-02-07 22:57:00,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2106 transitions. [2025-02-07 22:57:00,470 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2106 transitions. Word has length 481 [2025-02-07 22:57:00,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:00,470 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2106 transitions. [2025-02-07 22:57:00,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:00,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2106 transitions. [2025-02-07 22:57:00,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-02-07 22:57:00,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:00,473 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:57:00,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-02-07 22:57:00,473 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:00,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:00,473 INFO L85 PathProgramCache]: Analyzing trace with hash -535015382, now seen corresponding path program 1 times [2025-02-07 22:57:00,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:00,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841514383] [2025-02-07 22:57:00,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:00,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:00,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-02-07 22:57:00,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-02-07 22:57:00,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:00,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:01,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:01,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841514383] [2025-02-07 22:57:01,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841514383] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:01,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:01,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:57:01,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888107766] [2025-02-07 22:57:01,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:01,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:57:01,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:01,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:57:01,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:57:01,547 INFO L87 Difference]: Start difference. First operand 1617 states and 2106 transitions. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:01,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:01,790 INFO L93 Difference]: Finished difference Result 2678 states and 3512 transitions. [2025-02-07 22:57:01,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:01,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 482 [2025-02-07 22:57:01,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:01,792 INFO L225 Difference]: With dead ends: 2678 [2025-02-07 22:57:01,792 INFO L226 Difference]: Without dead ends: 1617 [2025-02-07 22:57:01,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:01,794 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 547 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:01,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1177 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:57:01,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-07 22:57:01,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-07 22:57:01,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1603 states have (on average 1.2975670617592014) internal successors, (2080), 1603 states have internal predecessors, (2080), 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-02-07 22:57:01,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2104 transitions. [2025-02-07 22:57:01,831 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2104 transitions. Word has length 482 [2025-02-07 22:57:01,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:01,832 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2104 transitions. [2025-02-07 22:57:01,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:01,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2104 transitions. [2025-02-07 22:57:01,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-02-07 22:57:01,835 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:01,835 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:57:01,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-02-07 22:57:01,835 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:01,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:01,835 INFO L85 PathProgramCache]: Analyzing trace with hash -2042291143, now seen corresponding path program 1 times [2025-02-07 22:57:01,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:01,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335189452] [2025-02-07 22:57:01,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:01,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:01,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-02-07 22:57:02,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-02-07 22:57:02,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:02,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:02,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:02,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335189452] [2025-02-07 22:57:02,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335189452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:02,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:02,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:02,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060783866] [2025-02-07 22:57:02,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:02,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:02,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:02,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:02,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:02,864 INFO L87 Difference]: Start difference. First operand 1617 states and 2104 transitions. Second operand has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:03,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:03,172 INFO L93 Difference]: Finished difference Result 2678 states and 3508 transitions. [2025-02-07 22:57:03,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:03,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 483 [2025-02-07 22:57:03,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:03,175 INFO L225 Difference]: With dead ends: 2678 [2025-02-07 22:57:03,175 INFO L226 Difference]: Without dead ends: 1617 [2025-02-07 22:57:03,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:03,177 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 1161 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1161 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:03,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1161 Valid, 1177 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:57:03,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-07 22:57:03,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-07 22:57:03,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1603 states have (on average 1.2963194011228947) internal successors, (2078), 1603 states have internal predecessors, (2078), 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-02-07 22:57:03,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2102 transitions. [2025-02-07 22:57:03,195 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2102 transitions. Word has length 483 [2025-02-07 22:57:03,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:03,195 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2102 transitions. [2025-02-07 22:57:03,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:03,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2102 transitions. [2025-02-07 22:57:03,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-02-07 22:57:03,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:03,198 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:57:03,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-02-07 22:57:03,198 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:03,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:03,198 INFO L85 PathProgramCache]: Analyzing trace with hash -539192662, now seen corresponding path program 1 times [2025-02-07 22:57:03,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:03,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795510989] [2025-02-07 22:57:03,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:03,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:03,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-02-07 22:57:03,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-02-07 22:57:03,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:03,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:04,126 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:04,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:04,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795510989] [2025-02-07 22:57:04,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795510989] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:04,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:04,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:04,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644764010] [2025-02-07 22:57:04,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:04,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:04,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:04,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:04,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:04,127 INFO L87 Difference]: Start difference. First operand 1617 states and 2102 transitions. Second operand has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:04,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:04,395 INFO L93 Difference]: Finished difference Result 2678 states and 3504 transitions. [2025-02-07 22:57:04,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:04,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 484 [2025-02-07 22:57:04,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:04,397 INFO L225 Difference]: With dead ends: 2678 [2025-02-07 22:57:04,397 INFO L226 Difference]: Without dead ends: 1617 [2025-02-07 22:57:04,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:04,398 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 623 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:04,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1183 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:57:04,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-07 22:57:04,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-07 22:57:04,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1603 states have (on average 1.2950717404865877) internal successors, (2076), 1603 states have internal predecessors, (2076), 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-02-07 22:57:04,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2100 transitions. [2025-02-07 22:57:04,416 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2100 transitions. Word has length 484 [2025-02-07 22:57:04,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:04,416 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2100 transitions. [2025-02-07 22:57:04,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:04,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2100 transitions. [2025-02-07 22:57:04,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-02-07 22:57:04,419 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:04,419 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:57:04,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-02-07 22:57:04,419 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:04,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:04,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1602237396, now seen corresponding path program 1 times [2025-02-07 22:57:04,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:04,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999884993] [2025-02-07 22:57:04,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:04,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:04,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-02-07 22:57:04,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-02-07 22:57:04,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:04,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:05,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:05,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999884993] [2025-02-07 22:57:05,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999884993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:05,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:05,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:57:05,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585284431] [2025-02-07 22:57:05,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:05,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:57:05,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:05,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:57:05,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:57:05,459 INFO L87 Difference]: Start difference. First operand 1617 states and 2100 transitions. Second operand has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:05,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:05,744 INFO L93 Difference]: Finished difference Result 2678 states and 3500 transitions. [2025-02-07 22:57:05,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:05,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 485 [2025-02-07 22:57:05,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:05,746 INFO L225 Difference]: With dead ends: 2678 [2025-02-07 22:57:05,746 INFO L226 Difference]: Without dead ends: 1617 [2025-02-07 22:57:05,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:05,748 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 1141 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:05,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1141 Valid, 1177 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:57:05,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-07 22:57:05,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-07 22:57:05,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1603 states have (on average 1.2938240798502807) internal successors, (2074), 1603 states have internal predecessors, (2074), 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-02-07 22:57:05,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2098 transitions. [2025-02-07 22:57:05,768 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2098 transitions. Word has length 485 [2025-02-07 22:57:05,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:05,768 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2098 transitions. [2025-02-07 22:57:05,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:05,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2098 transitions. [2025-02-07 22:57:05,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-02-07 22:57:05,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:05,771 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:57:05,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-02-07 22:57:05,771 INFO L396 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:05,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:05,772 INFO L85 PathProgramCache]: Analyzing trace with hash 359999154, now seen corresponding path program 1 times [2025-02-07 22:57:05,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:05,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446799432] [2025-02-07 22:57:05,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:05,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:05,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-07 22:57:06,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-07 22:57:06,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:06,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:06,830 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:06,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:06,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446799432] [2025-02-07 22:57:06,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446799432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:06,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:06,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:57:06,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504669942] [2025-02-07 22:57:06,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:06,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:57:06,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:06,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:57:06,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:57:06,832 INFO L87 Difference]: Start difference. First operand 1617 states and 2098 transitions. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:07,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:07,076 INFO L93 Difference]: Finished difference Result 2678 states and 3496 transitions. [2025-02-07 22:57:07,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:57:07,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 486 [2025-02-07 22:57:07,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:07,078 INFO L225 Difference]: With dead ends: 2678 [2025-02-07 22:57:07,078 INFO L226 Difference]: Without dead ends: 1617 [2025-02-07 22:57:07,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-02-07 22:57:07,080 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 511 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:07,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 1177 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:57:07,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-02-07 22:57:07,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-02-07 22:57:07,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1603 states have (on average 1.2925764192139737) internal successors, (2072), 1603 states have internal predecessors, (2072), 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-02-07 22:57:07,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2096 transitions. [2025-02-07 22:57:07,099 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2096 transitions. Word has length 486 [2025-02-07 22:57:07,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:07,099 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2096 transitions. [2025-02-07 22:57:07,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:07,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2096 transitions. [2025-02-07 22:57:07,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-02-07 22:57:07,103 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:07,103 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:57:07,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-02-07 22:57:07,103 INFO L396 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:07,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:07,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1370090068, now seen corresponding path program 1 times [2025-02-07 22:57:07,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:07,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195611336] [2025-02-07 22:57:07,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:07,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:07,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-02-07 22:57:08,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-02-07 22:57:08,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:08,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:08,532 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:08,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:08,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195611336] [2025-02-07 22:57:08,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195611336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:08,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:08,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:57:08,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260074625] [2025-02-07 22:57:08,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:08,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:57:08,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:08,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:57:08,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:08,533 INFO L87 Difference]: Start difference. First operand 1617 states and 2096 transitions. Second operand has 6 states, 6 states have (on average 76.66666666666667) internal successors, (460), 6 states have internal predecessors, (460), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:09,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:09,157 INFO L93 Difference]: Finished difference Result 3763 states and 4918 transitions. [2025-02-07 22:57:09,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:57:09,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 76.66666666666667) internal successors, (460), 6 states have internal predecessors, (460), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 487 [2025-02-07 22:57:09,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:09,159 INFO L225 Difference]: With dead ends: 3763 [2025-02-07 22:57:09,159 INFO L226 Difference]: Without dead ends: 2702 [2025-02-07 22:57:09,161 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-02-07 22:57:09,161 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 408 mSDsluCounter, 2140 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 2660 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:09,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 2660 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:57:09,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2025-02-07 22:57:09,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2561. [2025-02-07 22:57:09,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2561 states, 2541 states have (on average 1.2924045651318379) internal successors, (3284), 2541 states have internal predecessors, (3284), 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-02-07 22:57:09,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 3320 transitions. [2025-02-07 22:57:09,233 INFO L78 Accepts]: Start accepts. Automaton has 2561 states and 3320 transitions. Word has length 487 [2025-02-07 22:57:09,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:09,233 INFO L471 AbstractCegarLoop]: Abstraction has 2561 states and 3320 transitions. [2025-02-07 22:57:09,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.66666666666667) internal successors, (460), 6 states have internal predecessors, (460), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:09,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2561 states and 3320 transitions. [2025-02-07 22:57:09,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-02-07 22:57:09,237 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:09,237 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:57:09,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-02-07 22:57:09,238 INFO L396 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:09,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:09,238 INFO L85 PathProgramCache]: Analyzing trace with hash 2021978240, now seen corresponding path program 1 times [2025-02-07 22:57:09,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:09,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236530640] [2025-02-07 22:57:09,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:09,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:09,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-02-07 22:57:09,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-02-07 22:57:09,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:09,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:10,493 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 22:57:10,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:10,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236530640] [2025-02-07 22:57:10,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236530640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:10,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:10,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:57:10,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612179352] [2025-02-07 22:57:10,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:10,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:57:10,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:10,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:57:10,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:57:10,495 INFO L87 Difference]: Start difference. First operand 2561 states and 3320 transitions. Second operand has 6 states, 6 states have (on average 76.83333333333333) internal successors, (461), 6 states have internal predecessors, (461), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:11,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:11,125 INFO L93 Difference]: Finished difference Result 3668 states and 4784 transitions. [2025-02-07 22:57:11,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:57:11,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 76.83333333333333) internal successors, (461), 6 states have internal predecessors, (461), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 488 [2025-02-07 22:57:11,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:11,128 INFO L225 Difference]: With dead ends: 3668 [2025-02-07 22:57:11,128 INFO L226 Difference]: Without dead ends: 2607 [2025-02-07 22:57:11,129 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-02-07 22:57:11,129 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 1014 mSDsluCounter, 1397 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1017 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:11,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1017 Valid, 1866 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1167 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:57:11,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2607 states. [2025-02-07 22:57:11,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2607 to 2563. [2025-02-07 22:57:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2563 states, 2543 states have (on average 1.2921745969327565) internal successors, (3286), 2543 states have internal predecessors, (3286), 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-02-07 22:57:11,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 3322 transitions. [2025-02-07 22:57:11,153 INFO L78 Accepts]: Start accepts. Automaton has 2563 states and 3322 transitions. Word has length 488 [2025-02-07 22:57:11,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:11,154 INFO L471 AbstractCegarLoop]: Abstraction has 2563 states and 3322 transitions. [2025-02-07 22:57:11,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.83333333333333) internal successors, (461), 6 states have internal predecessors, (461), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:11,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 3322 transitions. [2025-02-07 22:57:11,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-02-07 22:57:11,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:11,157 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:57:11,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-02-07 22:57:11,157 INFO L396 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:11,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:11,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1722450563, now seen corresponding path program 1 times [2025-02-07 22:57:11,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:11,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713934378] [2025-02-07 22:57:11,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:11,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:11,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-02-07 22:57:11,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-02-07 22:57:11,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:11,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:12,647 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-07 22:57:12,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:12,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713934378] [2025-02-07 22:57:12,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713934378] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:57:12,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:57:12,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 22:57:12,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391372148] [2025-02-07 22:57:12,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:57:12,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:57:12,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:57:12,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:57:12,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:57:12,650 INFO L87 Difference]: Start difference. First operand 2563 states and 3322 transitions. Second operand has 8 states, 8 states have (on average 47.375) internal successors, (379), 8 states have internal predecessors, (379), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:13,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:57:13,394 INFO L93 Difference]: Finished difference Result 5936 states and 7686 transitions. [2025-02-07 22:57:13,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:57:13,394 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 47.375) internal successors, (379), 8 states have internal predecessors, (379), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 488 [2025-02-07 22:57:13,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:57:13,398 INFO L225 Difference]: With dead ends: 5936 [2025-02-07 22:57:13,398 INFO L226 Difference]: Without dead ends: 4523 [2025-02-07 22:57:13,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:57:13,399 INFO L435 NwaCegarLoop]: 1504 mSDtfsCounter, 1122 mSDsluCounter, 7062 mSDsCounter, 0 mSdLazyCounter, 2032 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 8566 SdHoareTripleChecker+Invalid, 2032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:57:13,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1125 Valid, 8566 Invalid, 2032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2032 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:57:13,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4523 states. [2025-02-07 22:57:13,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4523 to 2681. [2025-02-07 22:57:13,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2681 states, 2655 states have (on average 1.2930320150659134) internal successors, (3433), 2655 states have internal predecessors, (3433), 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-02-07 22:57:13,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2681 states and 3481 transitions. [2025-02-07 22:57:13,431 INFO L78 Accepts]: Start accepts. Automaton has 2681 states and 3481 transitions. Word has length 488 [2025-02-07 22:57:13,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:57:13,431 INFO L471 AbstractCegarLoop]: Abstraction has 2681 states and 3481 transitions. [2025-02-07 22:57:13,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 47.375) internal successors, (379), 8 states have internal predecessors, (379), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-07 22:57:13,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2681 states and 3481 transitions. [2025-02-07 22:57:13,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-02-07 22:57:13,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:57:13,434 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:57:13,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2025-02-07 22:57:13,434 INFO L396 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:57:13,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:57:13,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1399983961, now seen corresponding path program 1 times [2025-02-07 22:57:13,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:57:13,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639388452] [2025-02-07 22:57:13,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:13,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:57:13,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-02-07 22:57:15,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-02-07 22:57:15,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:57:15,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:57:19,059 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 81 proven. 38 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-02-07 22:57:19,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:57:19,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639388452] [2025-02-07 22:57:19,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639388452] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:57:19,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578783543] [2025-02-07 22:57:19,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:57:19,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:57:19,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:57:19,062 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 22:57:19,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 22:57:20,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes.